Sciweavers

1691 search results - page 106 / 339
» The Delayed k-Server Problem
Sort
View
WDAG
2007
Springer
100views Algorithms» more  WDAG 2007»
14 years 4 months ago
Scalable Load-Distance Balancing
We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a ...
Edward Bortnikov, Israel Cidon, Idit Keidar
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
14 years 3 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno
GLOBECOM
2007
IEEE
14 years 4 months ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong
AMC
2007
93views more  AMC 2007»
13 years 10 months ago
Moving averages of solutions of ODEs
Moving averages of the solution of an initial value problem for a system of ordinary differential equations are used to extract the general behavior of the solution without follow...
Lawrence F. Shampine, Skip Thompson
ICCAD
1997
IEEE
122views Hardware» more  ICCAD 1997»
14 years 2 months ago
Approximate timing analysis of combinational circuits under the XBD0 model
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
Yuji Kukimoto, Wilsin Gosti, Alexander Saldanha, R...