669 search results - page 125 / 134 » New Constraint Programming Approaches for the Computation of... |
NIPS
2004
13 years 8 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
CONEXT
2010
ACM
13 years 4 months ago
2010
ACM
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...
ESA
2004
Springer
14 years 3 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
EOR
2010
13 years 6 months ago
2010
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...