5138 search results - page 395 / 1028 » Randomized Algorithms for 3-SAT |
179
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
190
click to vote
SPIN
2004
Springer
16 years 2 days ago
2004
Springer
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
161
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
In this paper we introduce the first algorithms for efficiently learning a simulation policy for Monte-Carlo search. Our main idea is to optimise the balance of a simulation polic...
175
click to vote
SOFSEM
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
179
click to vote
NIPS
2008
15 years 8 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...