Sciweavers

3134 search results - page 486 / 627
» Computing full disjunctions
Sort
View
SPAA
2003
ACM
14 years 3 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
WSNA
2003
ACM
14 years 3 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
ATAL
2003
Springer
14 years 3 months ago
Optimizing information exchange in cooperative multi-agent systems
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
Claudia V. Goldman, Shlomo Zilberstein
ICALP
2003
Springer
14 years 3 months ago
Similarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
Vincent D. Blondel, Paul Van Dooren
ISCA
2010
IEEE
204views Hardware» more  ISCA 2010»
14 years 3 months ago
Energy proportional datacenter networks
Numerous studies have shown that datacenter computers rarely operate at full utilization, leading to a number of proposals for creating servers that are energy proportional with r...
Dennis Abts, Michael R. Marty, Philip M. Wells, Pe...