Sciweavers

2100 search results - page 95 / 420
» Fundamentals of the problem
Sort
View
IPPS
2005
IEEE
15 years 12 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
15 years 10 months ago
Mixed linear system estimation and identification
We consider a mixed linear system model, with both continuous and discrete inputs and outputs, described by a coefficient matrix and a set of noise variances. When the discrete inp...
Argyrios Zymnis, Stephen P. Boyd, Dimitry M. Gorin...
SOSP
1993
ACM
15 years 7 months ago
Understanding the Limitations of Causally and Totally Ordered Communication
Causally and totally ordered communication support (CATOCS) has been proposed as important to provide as part of the basic building blocks for constructing reliable distributed sy...
David R. Cheriton, Dale Skeen
COCO
2010
Springer
152views Algorithms» more  COCO 2010»
15 years 10 months ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
STOC
1991
ACM
167views Algorithms» more  STOC 1991»
15 years 9 months ago
Counting Networks and Multi-Processor Coordination
d Abstract) James Aspnes Maurice Herlihyy Nir Shavitz Digital Equipment Corporation Cambridge Research Lab CRL 90/11 September 18, 1991 Many fundamental multi-processor coordinati...
James Aspnes, Maurice Herlihy, Nir Shavit