32 search results - page 6 / 7 » An Extended Semidefinite Relaxation for Satisfiability |
ALT
2003
Springer
14 years 7 days ago
2003
Springer
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
AAAI
2007
13 years 11 months ago
2007
Automation of Web service composition is one of the most interesting challenges facing the Semantic Web today. In this paper we propose a mean of performing automated Web service ...
WAOA
2007
Springer
14 years 2 months ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
HEURISTICS
2010
13 years 6 months ago
2010
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
APPROX
2006
Springer
14 years 10 days ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...