Sciweavers

376 search results - page 60 / 76
» Solution Counting Algorithms for Constraint-Centered Search ...
Sort
View
JAIR
2008
145views more  JAIR 2008»
13 years 7 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
13 years 6 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
13 years 5 months ago
Interesting Subset Discovery and Its Application on Service Processes
Various real-life datasets can be viewed as a set of records consisting of attributes explaining the records and set of measures evaluating the records. In this paper, we address t...
Maitreya Natu, Girish Keshav Palshikar
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 7 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
GECCO
2003
Springer
132views Optimization» more  GECCO 2003»
14 years 28 days ago
Circuit Bipartitioning Using Genetic Algorithm
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
Jong-Pil Kim, Byung Ro Moon