1272 search results - page 63 / 255 » The Set Cover with Pairs Problem |
112
Voted
FUN
2007
Springer
15 years 4 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
102
Voted
SYNTHESE
2010
14 years 11 months ago
2010
We discuss several features of coherent choice functions – where the admissible options in a decision problem are exactly those which maximize expected utility for some probabil...
115
Voted
NETWORKS
2007
15 years 8 days ago
2007
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
PKDD
2007
Springer
15 years 7 months ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
109
Voted
LPNMR
2005
Springer
15 years 6 months ago
2005
Springer
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...