Sciweavers

763 search results - page 66 / 153
» Engineering Shortest Path Algorithms
Sort
View
JAIR
2002
106views more  JAIR 2002»
13 years 9 months ago
Collective Intelligence, Data Routing and Braess' Paradox
We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system (MAS) so that they work synergistically to maximize a globa...
David Wolpert, Kagan Tumer
INFOCOM
2011
IEEE
13 years 1 months ago
Analysis and algorithms for partial protection in mesh networks
—This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fract...
Greg Kuperman, Eytan Modiano, Aradhana Narula-Tam
TON
2010
158views more  TON 2010»
13 years 8 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
SIGMOD
2010
ACM
310views Database» more  SIGMOD 2010»
14 years 2 months ago
The DataPath system: a data-centric analytic processing engine for large data warehouses
Since the 1970’s, database systems have been “compute-centric”. When a computation needs the data, it requests the data, and the data are pulled through the system. We belie...
Subi Arumugam, Alin Dobra, Christopher M. Jermaine...
INFOCOM
2009
IEEE
14 years 4 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter