93 search results - page 2 / 19 » What Makes the Arc-Preserving Subsequence Problem Hard |
AI
2008
Springer
13 years 7 months ago
2008
Springer
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
EVOW
2004
Springer
13 years 11 months ago
2004
Springer
This paper presents an attempt to find a statistical model that predicts the hardness of the University Course Timetabling Problem by analyzing instance properties. The model may l...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
JAR
2007
13 years 7 months ago
2007
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
ECRTS
2010
IEEE
13 years 8 months ago
2010
IEEE
Embedded control systems with hard real-time constraints require that deadlines are met at all times or the system may malfunction with potentially catastrophic consequences. Sched...