Sciweavers

4114 search results - page 293 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
ICAI
2010
15 years 4 months ago
Constraint-Based Dogleg Channel Routing with Via Minimization
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
I-Lun Tseng, Huan-Wen Chen, Che-I Lee, Adam Postul...
CDC
2010
IEEE
133views Control Systems» more  CDC 2010»
15 years 1 months ago
Decentralized task assignment in camera networks
The problem of task assignment naturally arises in multiagent multitask systems, where an optimal matching of agents and tasks is sought. This problem is a combinatorial optimizati...
Angelo Cenedese, Federico Cerruti, Mirko Fabbro, C...
CSCW
2002
ACM
15 years 6 months ago
Achieving undo in bitmap-based collaborative graphics editing systems
Bitmap-based collaborative graphics editing systems are a special class of real-time collaborative editing systems. Undo is an important and difficult problem in these systems. Ex...
Xueyi Wang, Jiajun Bu, Chun Chen
DM
1999
109views more  DM 1999»
15 years 6 months ago
Hamiltonian powers in threshold and arborescent comparability graphs
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
Sam Donnelly, Garth Isaak
TIT
2002
125views more  TIT 2002»
15 years 6 months ago
Optimal bi-level quantization of i.i.d. sensor observations for binary hypothesis testing
We consider the problem of binary hypothesis testing using binary decisions from independent and identically distributed (i.i.d). sensors. Identical likelihood-ratio quantizers wit...
Qian Zhang, Pramod K. Varshney, Richard D. Wesel