1547 search results - page 161 / 310 » Randomized Variable Elimination |
101
Voted
ICAI
2003
15 years 2 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
92
Voted
JSAT
2008
15 years 1 months ago
2008
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior o...
118
Voted
TSP
2008
15 years 1 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
96
Voted
AI
1999
Springer
15 years 25 days ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
119
Voted
IJNSEC
2010
14 years 8 months ago
2010
Ad-hoc networking is a concept in computer communications. Each node participating in the network acts both as host and a router and must therefore is willing to forward packets f...