Sciweavers

617 search results - page 112 / 124
» Local Search for Heuristic Guidance in Tree Search
Sort
View
JAIR
2008
145views more  JAIR 2008»
15 years 6 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
ASC
2011
15 years 1 months ago
Quality of Service constrained routing optimization using Evolutionary Computation
In this work, a novel optimization framework is proposed that allows the improvement of Quality of Service levels in TCP/IP based networks, by configuring the routing weights of ...
Miguel Rocha, Pedro Sousa, Paulo Cortez, Miguel Ri...
ICML
1995
IEEE
16 years 6 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
ICALP
2005
Springer
15 years 11 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
15 years 10 months ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...