224 search results - page 31 / 45 » Algorithms for Solving Boolean Satisfiability in Combination... |
120
click to vote
KES
2008
Springer
14 years 11 months ago
2008
Springer
Evolutionary techniques provide powerful tools to design novel solutions for hard problems in different areas. However, the problem of scale (i.e. how to create a large, complex s...
AMAI
2005
Springer
14 years 11 months ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
An ensemble is a group of learners that work together as a committee to solve a problem. However, the existing ensemble training algorithms sometimes generate unnecessary large en...
112
click to vote
DATE
2004
IEEE
15 years 3 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
ATAL
2010
Springer
15 years 25 days ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...