Sciweavers

658 search results - page 44 / 132
» Partially Ordered Constraint Optimization Problems
Sort
View
AIPS
2006
14 years 11 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
13 years 5 days ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
FLAIRS
2004
14 years 11 months ago
CSAA: A Distributed Ant Algorithm Framework for Constraint Satisfaction
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
Koenraad Mertens, Tom Holvoet
ICRA
2006
IEEE
106views Robotics» more  ICRA 2006»
15 years 3 months ago
Decentralized Optimization of Distributed Supply-chain
— In this paper, the problem of optimizing the performances of a distributed supply chain is faced by means of a decentralized architecture. In particular, a general scheme for a...
Marco Ghirardi, Giuseppe Menga, Nicola Sacco
ANOR
2010
123views more  ANOR 2010»
14 years 10 months ago
Nature inspired genetic algorithms for hard packing problems
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
Philipp Rohlfshagen, John A. Bullinaria