Sciweavers

98 search results - page 16 / 20
» An ejection chain algorithm for the quadratic assignment pro...
Sort
View
UAI
2004
13 years 10 months ago
Annealed MAP
Maximum a Posteriori assignment (MAP) is the problem of finding the most probable instantiation of a set of variables given the partial evidence on the other variables in a Bayesi...
Changhe Yuan, Tsai-Ching Lu, Marek J. Druzdzel
IWQOS
2004
Springer
14 years 1 months ago
Topology design for service overlay networks with bandwidth guarantees
— The Internet still lacks adequate support for QoS applications with real-time requirements. In great part, this is due to the fact that provisioning of end-to-end QoS to traf...
S. L. Vieira, Jörg Liebeherr
SAT
2005
Springer
104views Hardware» more  SAT 2005»
14 years 2 months ago
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
Marijn Heule, Hans van Maaren
CP
2004
Springer
14 years 2 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
SLS
2007
Springer
103views Algorithms» more  SLS 2007»
14 years 2 months ago
Designing and Tuning SLS Through Animation and Graphics: An Extended Walk-Through
Stochastic Local Search (SLS) is quite effective for a variety of Combinatorial (Optimization) Problems (COP). However, the performance of SLS depends on several factors and getti...
Steven Halim, Roland H. C. Yap