Sciweavers

3433 search results - page 124 / 687
» Heuristics for a bidding problem
Sort
View
JAIR
2008
121views more  JAIR 2008»
15 years 6 months ago
A Constraint Programming Approach for Solving a Queueing Control Problem
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custom...
Daria Terekhov, J. Christopher Beck
NETWORKS
2007
15 years 6 months ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei
GECCO
2007
Springer
191views Optimization» more  GECCO 2007»
16 years 18 days ago
One-test-at-a-time heuristic search for interaction test suites
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...
Renée C. Bryce, Charles J. Colbourn
MTV
2003
IEEE
126views Hardware» more  MTV 2003»
15 years 11 months ago
Heuristic Backtracking Algorithms for SAT
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of f...
Ateet Bhalla, Inês Lynce, José T. de ...
JAIR
2006
120views more  JAIR 2006»
15 years 6 months ago
FluCaP: A Heuristic Search Planner for First-Order MDPs
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...
Steffen Hölldobler, Eldar Karabaev, Olga Skvo...