Sciweavers

995 search results - page 34 / 199
» Minimizing Congestion in General Networks
Sort
View
AAAI
1992
13 years 9 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
14 years 11 days ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
TON
2010
210views more  TON 2010»
13 years 2 months ago
A New Approach to Optical Networks Security: Attack-Aware Routing and Wavelength Assignment
Abstract-- Security issues and attack management in transparent WDM (Wavelength Division Multiplexing) optical networks has become of prime importance to network operators due to t...
Nina Skorin-Kapov, J. Chen, Lena Wosinska
ICIP
2002
IEEE
14 years 9 months ago
Protocols for distributed video streaming
With the explosive growth of video applications over the Internet, many approaches have been proposed to stream video effectively over packet switched, best-effort networks. In ou...
Thinh P. Q. Nguyen, Avideh Zakhor
CDC
2009
IEEE
191views Control Systems» more  CDC 2009»
14 years 26 days ago
Convergence and stability of a distributed CSMA algorithm for maximal network throughput
—Designing efficient scheduling algorithms is an important problem in a general class of networks with resourcesharing constraints, such as wireless networks and stochastic proc...
Libin Jiang, Jean C. Walrand