882 search results - page 130 / 177 » Local Search for Very Large SAT Problems |
164
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
122
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Most algorithms for real-time tracking of deformable shapes provide sub-optimal solutions for a suitable energy minimization task: The search space is typically considered too lar...
133
click to vote
FROCOS
2009
Springer
15 years 7 months ago
2009
Springer
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
131
click to vote
IADIS
2003
15 years 5 months ago
2003
Our research focuses on web information management for people who want to monitor and use the World Wide Web (WWW) information, as their information resource. Web information is m...
128
click to vote
JAIR
2008
15 years 3 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...