Sciweavers

2252 search results - page 386 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
TSP
2008
120views more  TSP 2008»
13 years 8 months ago
Distributed Average Consensus With Dithered Quantization
In this paper, we develop algorithms for distributed computation of averages of the node data over networks with bandwidth/power constraints or large volumes of data. Distributed ...
Tuncer C. Aysal, Mark Coates, Michael Rabbat
INFOCOM
2005
IEEE
14 years 2 months ago
The impact of imperfect scheduling on cross-layer rate control in wireless networks
— In this paper, we study cross-layer design for rate control in multihop wireless networks. In our previous work, we have developed an optimal cross-layered rate control scheme ...
Xiaojun Lin, Ness B. Shroff
FOCS
1989
IEEE
14 years 28 days ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
FMCAD
2004
Springer
14 years 18 days ago
Verification of Analog and Mixed-Signal Circuits Using Hybrid System Techniques
In this paper we demonstrate a potential extension of formal verification methodology in order to deal with time-domain properties of analog and mixed-signal circuits whose dynamic...
Thao Dang, Alexandre Donzé, Oded Maler
FLAIRS
2008
13 years 11 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan