2446 search results - page 327 / 490 » Choiceless Polynomial Time |
191
click to vote
WINE
2005
Springer
15 years 11 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
154
click to vote
COLT
2004
Springer
15 years 11 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
166
Voted
CONCUR
2004
Springer
15 years 11 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
205
click to vote
EMSOFT
2004
Springer
15 years 11 months ago
2004
Springer
In current embedded systems, one of the major concerns is energy conservation. The dynamic voltage-scheduling (DVS) framework, which involves dynamically adjusting the voltage and...
180
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...