Sciweavers

14649 search results - page 320 / 2930
» Principles of problem solving
Sort
View
SARA
2009
Springer
16 years 1 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
GECCO
2007
Springer
258views Optimization» more  GECCO 2007»
16 years 25 days ago
A genetic algorithm for resident physician scheduling problem
This paper formally presents the resident physician scheduling problem, which is one of the most important scheduling problems in hospital. The resident physician scheduling probl...
Chi-Way Wang, Lei-Ming Sun, Ming-Hui Jin, Chung-Ju...
APPT
2005
Springer
16 years 6 days ago
Autonomous-Centered Problem Allocation Oriented to Cooperation
By reasonably allocating a cooperative problem which need multiple solvers cope with together, the problem could be performed more effectively and efficiently. A problem could be d...
Xiping Liu, Wan-Chun Dou, Guihai Chen, Shijie Cai,...
COMPULOG
1999
Springer
15 years 11 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
COCOA
2008
Springer
15 years 8 months ago
Strong Formulations for 2-Node-Connected Steiner Network Problems
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...