63 search results - page 9 / 13 » Kernelization as Heuristic Structure for the Vertex Cover Pr... |
ICPR
2008
IEEE
14 years 5 months ago
2008
IEEE
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...
SAT
2004
Springer
14 years 4 months ago
2004
Springer
The Boolean circuits is well established as a data structure for building propositional encodings of problems in preparation for satisfiability solving. The standard method for co...
TCAD
1998
13 years 10 months ago
1998
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
EVOW
2009
Springer
14 years 5 months ago
2009
Springer
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...
AI
2010
Springer
13 years 11 months ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...