4110 search results - page 219 / 822 » Efficient algorithms for the 2-gathering problem |
167
click to vote
DFT
2005
IEEE
16 years 4 days ago
2005
IEEE
Fabricating large memory and processor arrays is subject to physical failures resulting in yield degradation. The strategy of incorporating spare rows and columns to obtain reason...
182
click to vote
COMCOM
2006
15 years 6 months ago
2006
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
200
click to vote
SOCO
2010
Springer
15 years 1 months ago
2010
Springer
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...
200
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
153
click to vote
CAV
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...