3038 search results - page 535 / 608 » Controlling Engineering Problem Solving |
AAAI
2006
13 years 10 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
COMPUTER
1999
13 years 8 months ago
1999
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
JAIR
2000
13 years 9 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
COGSCI
2008
13 years 8 months ago
2008
This article investigates the potential of fMRI to test assumptions about different components in models of complex cognitive tasks. If the components of a model can be associated...
GECCO
2006
Springer
14 years 22 days ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...