2168 search results - page 155 / 434 » Randomized Algorithms and Complexity Theory |
184
Voted
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
131
Voted
ESA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
135
Voted
ISSTA
2004
ACM
15 years 9 months ago
2004
ACM
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
154
Voted
SIGECOM
2010
ACM
15 years 8 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
138
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...