Sciweavers

16430 search results - page 484 / 3286
» On Computable Tree Functions
Sort
View
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 4 months ago
Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
Fen Zhou, Miklós Molnár, Bernard Cou...
TVLSI
2010
15 years 1 months ago
Discrete Buffer and Wire Sizing for Link-Based Non-Tree Clock Networks
Clock network is a vulnerable victim of variations as well as a main power consumer in many integrated circuits. Recently, link-based non-tree clock network attracts people's...
Rupak Samanta, Jiang Hu, Peng Li
CP
2011
Springer
14 years 6 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
SPAA
2006
ACM
16 years 27 days ago
Symmetric network computation
We introduce a simple new model of distributed computation — finite-state symmetric graph automata (FSSGA) — which captures the qualitative properties common to fault-toleran...
David Pritchard, Santosh Vempala
TIT
2010
138views Education» more  TIT 2010»
15 years 1 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...