1142 search results - page 155 / 229 » Approximability of Clausal Constraints |
181
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
167
click to vote
SGP
2004
15 years 8 months ago
2004
We present a method for parameterizing irregularly triangulated input models over polyhedral domains with quadrilateral faces. A combination of center-based clustering techniques ...
163
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
185
click to vote
NIPS
2004
15 years 7 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
147
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
d Abstract) Moses Charikar Samir Khullery David M. Mountz Giri Narasimhanx Facility location problems are traditionally investigated with the assumption that all the clients are t...