Sciweavers

218 search results - page 34 / 44
» Quantum-inspired evolutionary algorithm for a class of combi...
Sort
View
JAIR
2007
141views more  JAIR 2007»
13 years 8 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
PAMI
2007
176views more  PAMI 2007»
13 years 8 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
GECCO
2007
Springer
200views Optimization» more  GECCO 2007»
14 years 2 months ago
Adaptive variance scaling in continuous multi-objective estimation-of-distribution algorithms
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...
Peter A. N. Bosman, Dirk Thierens
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 6 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
IJCAI
1997
13 years 10 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter