4524 search results - page 815 / 905 » The Complexity of Global Constraints |
100
Voted
INFORMS
1998
15 years 8 days ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
132
Voted
TON
2002
15 years 7 days ago
2002
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
113
click to vote
TROB
2002
15 years 7 days ago
2002
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
129
Voted
PVLDB
2008
15 years 2 days ago
2008
The old problem of managing the history of database information is now made more urgent and complex by fast spreading web information systems, such as Wikipedia. Our PRIMA system ...
112
Voted
LATIN
2010
Springer
14 years 11 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...