5316 search results - page 155 / 1064 » Which Search Problems Are Random |
118
click to vote
DAC
2007
ACM
16 years 4 months ago
2007
ACM
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
129
Voted
IJAIT
2002
15 years 3 months ago
2002
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
117
Voted
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
114
Voted
AAAI
2008
15 years 6 months ago
2008
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
101
Voted
CONCUR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...