ผลต่างระหว่างรุ่นของ "ผู้ใช้:Jittat"

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
 
(ไม่แสดง 19 รุ่นระหว่างกลางโดยผู้ใช้ 3 คน)
แถว 1: แถว 1:
 +
<pre>
 +
../sim-data/interaction/bkk1-1.txt
 +
Max congestion 211 197 218 208.6666666667
 +
Average congestion 103.164383562 93.8493150685 108.260273973 101.7579908678
 +
Station-Hub index 0.0410958904 0.0410958904 0.0136986301 0.0319634703
 +
Innovation index 0.0443092408 0.0405127046 0.0518444422 0.0455554625
 +
 +
../sim-data/interaction/bkk2-1.txt
 +
Max congestion 206 217 223 215.3333333333
 +
Average congestion 94.9407407407 97.4518518519 102.377777778 98.2567901235
 +
Station-Hub index 0.0518518519 0.0666666667 0.1037037037 0.0740740741
 +
Innovation index 0.0629198717 0.063944155 0.0732601203 0.066708049
 +
 +
../sim-data/interaction/ny-1.txt
 +
Max congestion 268 289 285 280.6666666667
 +
Average congestion 48.0898661568 51.2198852772 49.2026515152 49.5041343164
 +
Station-Hub index 0.1128107075 0.0975143403 0.0984848485 0.1029366321
 +
Innovation index 0.0658621693 0.0704888402 0.0703332644 0.068894758
 +
 +
../sim-data/interaction/taipei-1.txt
 +
Max congestion 281 271 271 274.3333333333
 +
Average congestion 90.5655737705 92.3524590164 91.8196721311 91.5792349727
 +
Station-Hub index 0.0573770492 0.0655737705 0.0491803279 0.0573770492
 +
Innovation index 0.0769343194 0.0780671755 0.0757931386 0.0769315445
 +
</pre>
 +
 +
 
== My bookmarks ==
 
== My bookmarks ==
 +
* [[Pclips|คลิปวิดีโอการพิสูจน์]], [[Pex|แบบฝึกหัด]]
 +
* [[practicum clips]]
 +
* [[User:Jittat/links]]
 +
* [[NTRD|Non-theory research division]] เป็นกลุ่มย่อยภายใต้กลุ่มวิจัยเชิงทฤษฎี
 
* [[204512]]
 
* [[204512]]
 
* [[Software Testing Course]]
 
* [[Software Testing Course]]
 
* [[Oct07camp|ตารางอบรมกลางคืน ค่ายโอลิมปิครอบ 2]]
 
* [[Oct07camp|ตารางอบรมกลางคืน ค่ายโอลิมปิครอบ 2]]
 
* [[New platform]] สำหรับ สอวน./โอลิมปิครอบแรก
 
* [[New platform]] สำหรับ สอวน./โอลิมปิครอบแรก
 +
* [[Worktraining51]] และ [[Co-op51]]
 +
* [[ioi training 08|ค่ายอบรมสำหรับคอมพิวเตอร์โอลิมปิคปี 2008]]
 +
* [[jittat/ioi stuffs]]
  
 
== Dynamic Programming Languages Bookmark ==
 
== Dynamic Programming Languages Bookmark ==
แถว 27: แถว 61:
 
* [http://www.nextgreatthing.com/ Next Great Thing]
 
* [http://www.nextgreatthing.com/ Next Great Thing]
  
−
=== Twitter ===
+
Hot damn, looking pretty usfuel buddy.
−
* [http://headrush.typepad.com/creating_passionate_users/2006/12/httpwww37signal.html Twitter Curve]
 
  
 
== Reading groups ==
 
== Reading groups ==
 
* '''Randomized Algorithms.'''  Focus on classic results.  Some of the papers and references below are from Motwani and Raghavan.
 
* '''Randomized Algorithms.'''  Focus on classic results.  Some of the papers and references below are from Motwani and Raghavan.
 
** '''Routing.'''  Valiant.  A scheme for fast parallel communication.  ''SIAM Journal on Computing,'' 11:350-361, 1982.  (Should be available at AIT Library)
 
** '''Routing.'''  Valiant.  A scheme for fast parallel communication.  ''SIAM Journal on Computing,'' 11:350-361, 1982.  (Should be available at AIT Library)
−
** '''Paging.''' Fiat, Karp, Luby, McGeoch, Sleator, and Young.  Competitive paging algorithms.  ''Journal of Algorithms,'' 12:685-699, 1991.
+
** '''Paging.''' Fiat, Karp, Luby, McGeoch, Sleator, and Young.  Competitive paging algorithms.  ''Journal of Algorithms,'' 12:685-699, 1991. [http://www.cs.cmu.edu/~sleator/papers/competitive-paging.pdf]
−
** '''Byzantine Agreement.''' Rabin.  Randomized Byzantine generals.  In ''Proceedings of the 24th Annual Symposium on Foundations of Computer Science,'' page 403-409, 1983.  (Also, see Chor and Dwork.  Randomization in Byzantine agreement. In ''Randomness and Computing'' pages 433-497. JAI Press, 1989)
+
** '''Byzantine agreement.''' Rabin.  Randomized Byzantine generals.  In ''Proceedings of the 24th Annual Symposium on Foundations of Computer Science,'' page 403-409, 1983.  (Also, see Chor and Dwork.  Randomization in Byzantine agreement. In ''Randomness and Computing'' pages 433-497. JAI Press, 1989)
 +
** '''Min-cut.'''
 +
**# David R. Karger, Clifford Stein. A New Approach to the Minimum Cut Problem. ''J. ACM'' 43(4): 601-640 (1996) [http://portal.acm.org/citation.cfm?doid=234533.234534]
 +
**# David R. Karger: Minimum cuts in near-linear time. ''J. ACM'' 47(1): 46-76 (2000) [http://portal.acm.org/citation.cfm?doid=331605.331608]
 +
** '''Derandomization.''' Nisan and Wigderson.  Hardness vs. randomness. ''Journal of Computer and System Sciences,'' 49(2) pages: 149 - 167, 1994. [http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/NOAM/HARDNESS/final.pdf]
 +
** '''Zero-knowledge.'''
 +
**# Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof-systems. In ''Proceedings of 17th Symposium on the Theory of Computation,'' Providence, Rhode Island. 1985. [http://theory.lcs.mit.edu/~cis/pubs/shafi/1985-stoc.pdf]
 +
**# Oded Goldreich, Silvio Micali, Avi Wigderson. Proofs that yield nothing but their validity. ''Journal of the ACM,'' volume 38, issue 3, p.690-728. July 1991. [http://portal.acm.org/citation.cfm?id=116852]
 
** '''Isolating Lemma.''' Mulmuley, Vazirani, and Vazirani.  Matching is as Easy as Matrix Inversion. in ''Proceedings of Symposium on the Theory of Computing,'' 1987.  ''Combinatorica,'' Vol. 7, No. 1, 1987. [http://www.cs.berkeley.edu/~vazirani/pubs/matching.pdf]
 
** '''Isolating Lemma.''' Mulmuley, Vazirani, and Vazirani.  Matching is as Easy as Matrix Inversion. in ''Proceedings of Symposium on the Theory of Computing,'' 1987.  ''Combinatorica,'' Vol. 7, No. 1, 1987. [http://www.cs.berkeley.edu/~vazirani/pubs/matching.pdf]
 +
** '''Primality testing.'''
 
** '''Lovasz Local Lemma.'''
 
** '''Lovasz Local Lemma.'''
−
** '''Primality testing.'''
 
  
 
Other possible topics:
 
Other possible topics:

รุ่นแก้ไขปัจจุบันเมื่อ 02:51, 26 กุมภาพันธ์ 2560

../sim-data/interaction/bkk1-1.txt					
Max	congestion	211	197	218	208.6666666667
Average	congestion	103.164383562	93.8493150685	108.260273973	101.7579908678
Station-Hub	index	0.0410958904	0.0410958904	0.0136986301	0.0319634703
Innovation	index	0.0443092408	0.0405127046	0.0518444422	0.0455554625
					
../sim-data/interaction/bkk2-1.txt					
Max	congestion	206	217	223	215.3333333333
Average	congestion	94.9407407407	97.4518518519	102.377777778	98.2567901235
Station-Hub	index	0.0518518519	0.0666666667	0.1037037037	0.0740740741
Innovation	index	0.0629198717	0.063944155	0.0732601203	0.066708049
					
../sim-data/interaction/ny-1.txt					
Max	congestion	268	289	285	280.6666666667
Average	congestion	48.0898661568	51.2198852772	49.2026515152	49.5041343164
Station-Hub	index	0.1128107075	0.0975143403	0.0984848485	0.1029366321
Innovation	index	0.0658621693	0.0704888402	0.0703332644	0.068894758
					
../sim-data/interaction/taipei-1.txt					
Max	congestion	281	271	271	274.3333333333
Average	congestion	90.5655737705	92.3524590164	91.8196721311	91.5792349727
Station-Hub	index	0.0573770492	0.0655737705	0.0491803279	0.0573770492
Innovation	index	0.0769343194	0.0780671755	0.0757931386	0.0769315445


My bookmarks

Dynamic Programming Languages Bookmark

Teen and Tech bookmark

Media & Interactive

News

Blogs

Hot damn, looking pretty usfuel buddy.

Reading groups

  • Randomized Algorithms. Focus on classic results. Some of the papers and references below are from Motwani and Raghavan.
    • Routing. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11:350-361, 1982. (Should be available at AIT Library)
    • Paging. Fiat, Karp, Luby, McGeoch, Sleator, and Young. Competitive paging algorithms. Journal of Algorithms, 12:685-699, 1991. [1]
    • Byzantine agreement. Rabin. Randomized Byzantine generals. In Proceedings of the 24th Annual Symposium on Foundations of Computer Science, page 403-409, 1983. (Also, see Chor and Dwork. Randomization in Byzantine agreement. In Randomness and Computing pages 433-497. JAI Press, 1989)
    • Min-cut.
      1. David R. Karger, Clifford Stein. A New Approach to the Minimum Cut Problem. J. ACM 43(4): 601-640 (1996) [2]
      2. David R. Karger: Minimum cuts in near-linear time. J. ACM 47(1): 46-76 (2000) [3]
    • Derandomization. Nisan and Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49(2) pages: 149 - 167, 1994. [4]
    • Zero-knowledge.
      1. Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof-systems. In Proceedings of 17th Symposium on the Theory of Computation, Providence, Rhode Island. 1985. [5]
      2. Oded Goldreich, Silvio Micali, Avi Wigderson. Proofs that yield nothing but their validity. Journal of the ACM, volume 38, issue 3, p.690-728. July 1991. [6]
    • Isolating Lemma. Mulmuley, Vazirani, and Vazirani. Matching is as Easy as Matrix Inversion. in Proceedings of Symposium on the Theory of Computing, 1987. Combinatorica, Vol. 7, No. 1, 1987. [7]
    • Primality testing.
    • Lovasz Local Lemma.

Other possible topics:

  • Algorithmic Game Theory:
    • Probably following [8]
  • Distributed Computing: selection from [9]
ดึงข้อมูลจาก "http://158.108.32.49/wiki/index.php?title=ผู้ใช้:Jittat&oldid=57615"