994 search results - page 15 / 199 » Custom Computing Machines for the Set Covering Problem |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
JAL
2006
13 years 7 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
AMEC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Supply chains are a current, challenging problem for agentbased electronic commerce. Motivated by the Trading Agent Competition Supply Chain Management (TAC SCM) scenario...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Motivated by the problem of customer wallet estimation, we propose a new setting for multi-view regression, where we learn a completely unobserved target (in our case, customer wa...