4850 search results - page 925 / 970 » Proof and Computation in Geometry |
87
Voted
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
102
click to vote
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
TELETRAFFIC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We focus in this paper on passive traffic measurement techniques that collect traces of TCP packets and analyze them to derive, for example, round-trip times or aggregate...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
110
click to vote
SPAA
2006
ACM
15 years 5 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...