5316 search results - page 186 / 1064 » Which Search Problems Are Random |
118
click to vote
ESA
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signiï¬...
107
click to vote
ISW
2009
Springer
15 years 10 months ago
2009
Springer
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
121
click to vote
SIAMDM
2010
14 years 10 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
147
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
107
click to vote
JDA
2010
15 years 2 months ago
2010
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...