Sciweavers

2926 search results - page 463 / 586
» Partially Optimal Routing
Sort
View
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 6 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
JSAC
2007
128views more  JSAC 2007»
15 years 3 months ago
Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?
— Most of the real deployed peer-to-peer streaming systems adopt pull-based streaming protocol. In this paper, we demonstrate that, besides simplicity and robustness, with proper...
Meng Zhang, Qian Zhang, Lifeng Sun, Shiqiang Yang
COCOA
2009
Springer
15 years 7 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 3 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
INFOCOM
2009
IEEE
15 years 9 months ago
Distributed Opportunistic Scheduling With Two-Level Channel Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...