920 search results - page 16 / 184 » Generating Satisfiable Problem Instances |
NIPS
2003
13 years 9 months ago
2003
Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for classification problems where labels are associated with se...
EVOW
2003
Springer
14 years 26 days ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
ICFEM
2009
Springer
13 years 5 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
NETWORKS
2007
13 years 7 months 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...
DAM
2008
13 years 7 months ago
2008
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...