Sciweavers

1016 search results - page 125 / 204
» Parallelism Constraints
Sort
View
AIPS
1994
13 years 10 months ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu
AAAI
1990
13 years 10 months ago
An Organizational Approach to Adaptive Production Systems
Recently-developed techniques have improved the performance of production systems several times over. However, these techniques are not yet adequate for continuous problem solving...
Toru Ishida, Makoto Yokoo, Les Gasser
CVPR
2010
IEEE
13 years 9 months ago
Deconvolutional networks
Building robust low and mid-level image representations, beyond edge primitives, is a long-standing goal in vision. Many existing feature detectors spatially pool edge information...
Matthew D. Zeiler, Dilip Krishnan, Graham W. Taylo...
EOR
2010
96views more  EOR 2010»
13 years 9 months ago
The hybrid flow shop scheduling problem
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...
Rubén Ruiz, José Antonio Vázq...
COR
2007
80views more  COR 2007»
13 years 9 months ago
A heuristic approach to simultaneous course/student timetabling
Many approaches have been taken in academic environments to address the problem of student and course timetabling. Typically, student scheduling and course scheduling have been tr...
Christopher Head, Sami Shaban