706 search results - page 30 / 142 » Super Solutions in Constraint Programming |
UM
2009
Springer
15 years 6 months ago
2009
Springer
Ideally designed software allow users to explore and pursue interleaving plans, making it challenging to automatically recognize user interactions. The recognition algorithms prese...
CP
2004
Springer
15 years 5 months ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
VLSID
2002
IEEE
16 years 4 days ago
2002
IEEE
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
MOZ
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Here we introduce DePathos, a graphical tool for a timetabling constraint engine (Pathos). Since the core of Pathos is textbased and provides little user-interaction, fi...