920 search results - page 16 / 184 » Generating Satisfiable Problem Instances |
111
click to vote
NIPS
2003
15 years 2 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...
95
Voted
EVOW
2003
Springer
15 years 6 months 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...
116
Voted
ICFEM
2009
Springer
14 years 10 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...
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...
92
Voted
DAM
2008
15 years 26 days 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...