Sciweavers

9842 search results - page 448 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
143
Voted
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 7 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
178
Voted
CORR
2006
Springer
85views Education» more  CORR 2006»
15 years 7 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil
210
Voted
IJON
2008
158views more  IJON 2008»
15 years 7 months ago
Blind separation of convolutive image mixtures
Convolutive mixtures of images are common in photography of semi-reflections. They also occur in microscopy and tomography. Their formation process involves focusing on an object ...
Sarit Shwartz, Yoav Y. Schechner, Michael Zibulevs...
IPL
2008
95views more  IPL 2008»
15 years 7 months ago
Efficient algorithms for finding interleaving relationship between sequences
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hs...
181
Voted
JSAC
2007
109views more  JSAC 2007»
15 years 7 months ago
Optimization of Semi-Dynamic Lightpath Rearrangements in a WDM Network
— In this paper, we study the Routing and Wavelength Assignment (RWA) problem in a semi-dynamic scenario where rearrangements are conducted in a series of sessions after traffic...
Yiming Zhang, Oliver W. W. Yang, Jing Wu, Michel S...