8413 search results - page 161 / 1683 » Ordering Problem Subgoals |
72
Voted
SYNTHESE
2008
15 years 18 days 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...
111
click to vote
LATIN
2000
Springer
15 years 4 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...
90
Voted
IJCGA
2006
15 years 21 days 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...
90
Voted
SIGOPSE
2000
ACM
15 years 5 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...
118
Voted
AAAI
1996
15 years 2 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...