388 search results - page 27 / 78 » Improving Exact Algorithms for MAX-2-SAT |
BMCBI
2006
13 years 8 months ago
2006
Background: Supervised learning for classification of cancer employs a set of design examples to learn how to discriminate between tumors. In practice it is crucial to confirm tha...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
ICALP
2007
Springer
14 years 3 months ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
GECCO
2011
Springer
13 years 8 days ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
VLDB
2004
ACM
14 years 2 months ago
2004
ACM
Query processing in database systems has developed beyond mere exact matching of attribute values. Scoring database objects and retrieving only the top k matches or Pareto-optimal...