4524 search results - page 45 / 905 » The Complexity of Global Constraints |
104
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
103
click to vote
PCM
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we propose a robust text segmentation method in complex background. The proposed method first utilizes the K-means algorithm to decompose a detected text block into ...
118
click to vote
ASPDAC
2005
ACM
15 years 2 months ago
2005
ACM
-- This paper presents a novel global routing algorithm, AT-PO-GR, to minimize the routing area under both congestion, timing, and RLC crosstalk constraints. The proposed algorithm...
93
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
97
Voted
IJAR
2008
15 years 15 days ago
2008
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying AI uncertainty formalis...