Sciweavers

5889 search results - page 1016 / 1178
» Graph Layout Problems
Sort
View
109
Voted
TCS
2008
15 years 2 months ago
Distance- k knowledge in self-stabilizing algorithms
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
JACM
2007
121views more  JACM 2007»
15 years 2 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
TKDE
2008
134views more  TKDE 2008»
15 years 2 months ago
Contraflow Transportation Network Reconfiguration for Evacuation Route Planning
Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) ...
Sangho Kim, Shashi Shekhar, Manki Min
AI
2002
Springer
15 years 2 months ago
Coherence in finite argument systems
Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two imp...
Paul E. Dunne, Trevor J. M. Bench-Capon
DPD
2002
168views more  DPD 2002»
15 years 2 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...
« Prev « First page 1016 / 1178 Last » Next »