388 search results - page 22 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
AMC
2006
13 years 8 months ago
2006
ct 9 A new discrete-velocity method for the numerical solution of large eddy simulation (LES) is presented based on relax10 ation type formulation. The discrete-velocity equations ...
ICNC
2005
Springer
14 years 2 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
CP
2006
Springer
14 years 14 days ago
2006
Springer
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the bes...
CPAIOR
2006
Springer
14 years 14 days ago
2006
Springer
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
IJCAI
1997
13 years 10 months ago
1997
Planning for real-time applications involves decisions not only about what actions to take in what states to progress toward achieving goals (the traditional decision problem face...