Sciweavers

5493 search results - page 274 / 1099
» Effectively Polynomial Simulations
Sort
View
TCOM
2008
63views more  TCOM 2008»
15 years 6 months ago
A general construction of constrained parity-check codes for optical recording
This paper proposes a general and systematic code design method to efficiently combine constrained codes with parity-check (PC) codes for optical recording. The proposed constraine...
Kui Cai, Kees A. Schouhamer Immink
TON
2008
125views more  TON 2008»
15 years 6 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
182
Voted
TROB
2008
164views more  TROB 2008»
15 years 6 months ago
Dynamic Assignment in Distributed Motion Planning With Local Coordination
Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in applications such as coverage by mobile senso...
Michael M. Zavlanos, George J. Pappas
COMCOM
2000
96views more  COMCOM 2000»
15 years 6 months ago
A routing algorithm for dynamic multicast trees with end-to-end path length control
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
Hiroshi Fujinoki, Kenneth J. Christensen
COMCOM
2007
123views more  COMCOM 2007»
15 years 6 months ago
Heuristic and optimal techniques for light-trail assignment in optical ring WDM networks
In this paper we address the problem of constrained optimization (ILP formulation) and propose a set of heuristic algorithms for assigning light-trails [1–4,7,10] to WDM ring ne...
Ashwin Gumaste, Paparao Palacharla