Sciweavers

254 search results - page 36 / 51
» Deterministic Soliton Graphs
Sort
View
WIOPT
2006
IEEE
15 years 3 months ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi
FCT
2005
Springer
15 years 3 months ago
A Simple and Fast Min-cut Algorithm
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
Michael Brinkmeier
PODC
2004
ACM
15 years 2 months ago
Load balancing and locality in range-queriable data structures
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...
SAS
2004
Springer
15 years 2 months ago
A Polynomial-Time Algorithm for Global Value Numbering
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
Sumit Gulwani, George C. Necula
ISAAC
1999
Springer
110views Algorithms» more  ISAAC 1999»
15 years 1 months ago
Online Routing in Triangulations
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
Prosenjit Bose, Pat Morin