699 search results - page 44 / 140 » The method of combinatorial telescoping |
CP
2010
Springer
13 years 7 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
CP
2009
Springer
14 years 3 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
APSCC
2007
IEEE
14 years 2 months ago
2007
IEEE
A suitable assignment of agents to handle the workload at a call center is not easy to fulfill because it requires a combinatorial optimization with large solution space and the n...
PUK
2001
13 years 10 months ago
2001
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...