8413 search results - page 161 / 1683 » Ordering Problem Subgoals |
SYNTHESE
2008
13 years 10 months ago
2008
The paper argues, that a direct formalization of the way common sense thinks about the numerical identity of enduring entities, requires that traditional predicate logic is develo...
LATIN
2000
Springer
14 years 2 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
IJCGA
2006
13 years 10 months ago
2006
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
SIGOPSE
2000
ACM
14 years 2 months ago
2000
ACM
The demand for network-enabled limited-footprint mobile devices is increasing rapidly. A central challenge that must be addressed in order to use these next-generation devices eff...
AAAI
1996
13 years 11 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...