Sciweavers

77 search results - page 9 / 16
» A Bit-Parallel Search Algorithm for Allocating Free Space
Sort
View
JAIR
2007
141views more  JAIR 2007»
13 years 7 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
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
14 years 27 days ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
AI
2002
Springer
13 years 7 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
IROS
2008
IEEE
142views Robotics» more  IROS 2008»
14 years 1 months ago
Probabilistic mapping of dynamic obstacles using Markov chains for replanning in dynamic environments
— Robots acting in populated environments must be capable of safe but also time efficient navigation. Trying to completely avoid regions resulting from worst case predictions of...
Florian Rohrmüller, Matthias Althoff, Dirk Wo...
GECCO
2005
Springer
144views Optimization» more  GECCO 2005»
14 years 27 days ago
Multiobjective hBOA, clustering, and scalability
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominat...
Martin Pelikan, Kumara Sastry, David E. Goldberg