836 search results - page 146 / 168 » On the Complexity of Train Assignment Problems |
143
click to vote
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
167
click to vote
PRL
2010
15 years 2 months ago
2010
This study regards the problem of incorrect stereo matches due to the occurrence of repetitive structures in the scene. In stereo vision, repetitive structures may lead to “phan...
150
click to vote
MOBIHOC
2010
ACM
15 years 1 months ago
2010
ACM
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...
130
click to vote
MOBIHOC
2006
ACM
16 years 3 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
146
click to vote
ICCAD
1995
IEEE
15 years 7 months ago
1995
IEEE
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...