3020 search results - page 471 / 604 » Optimal partition trees |
159
click to vote
AAAI
1998
15 years 7 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
185
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
186
click to vote
ANOR
2008
15 years 6 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
161
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
: - In the first part of this paper we present the first steps towards providing low-risk and economically feasible network data transfer services. We introduce three types of data...
195
click to vote
DISOPT
2010
15 years 6 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...