Sciweavers

1016 search results - page 164 / 204
» Optimized algorithms for multi-agent routing
Sort
View
VLDB
2004
ACM
100views Database» more  VLDB 2004»
15 years 3 months ago
Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molin...
COCOON
2006
Springer
15 years 1 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
ICUMT
2009
14 years 7 months ago
SBCL - improved centroid estimation
Localization of sensor nodes is one of the key issues in Wireless Sensor Networks. It is a precondition for a variety of applications, as well as geographic clustering and routing....
Ralf Behnke, Jakob Salzmann, Dirk Timmermann
ICPPW
2009
IEEE
15 years 4 months ago
Dynamic Control and Resource Allocation in Wireless-Infrastructured Distributed Cellular Networks with OFDMA
—In this paper, we consider joint optimization of end-to-end data transmission and resource allocation for Wireless-Infrastructured Distributed Cellular Networks (WIDCNs), where ...
Lei You, Ping Wu, Mei Song, Junde Song, Yong Zhang
ICCAD
2003
IEEE
98views Hardware» more  ICCAD 2003»
15 years 6 months ago
Achieving Design Closure Through Delay Relaxation Parameter
Current design automation methodologies are becoming incapable of achieving design closure especially in the presence of deep submicron effects. This paper addresses the issue of ...
Ankur Srivastava, Seda Ogrenci Memik, Bo-Kyung Cho...