Sciweavers

134 search results - page 8 / 27
» Speeding Up Dynamic Shortest-Path Algorithms
Sort
View
AIPS
1994
13 years 9 months ago
Managing Dynamic Temporal Constraint Networks
This paper concerns the specialization of arcconsistency algorithms for constraint satisfaction in the management of quantitative temporal constraint networks. Attention is devote...
Roberto Cervoni, Amedeo Cesta, Angelo Oddi
ATAL
2005
Springer
14 years 1 months ago
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
Syed Muhammad Ali, Sven Koenig, Milind Tambe
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
14 years 8 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...
IAT
2007
IEEE
14 years 1 months ago
Noise Tolerance in Reinforcement Learning Algorithms
This paper proposes a mechanism of noise tolerance for reinforcement learning algorithms. An adaptive agent that employs reinforcement learning algorithms may receive and accumula...
Richardson Ribeiro, Alessandro L. Koerich, Fabr&ia...
ICDCS
2007
IEEE
14 years 1 months ago
Distributed Slicing in Dynamic Systems
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
Antonio Fernández, Vincent Gramoli, Ernesto...