321 search results - page 57 / 65 » Partitioning by iterative deletion |
CP
2010
Springer
13 years 7 months ago
2010
Springer
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive d...
DLT
2009
13 years 6 months ago
2009
A famous theorem of Kuratowski states that, in a topological space, at most 14 distinct sets can be produced by repeatedly applying the operations of closure and complement to a gi...
EMNLP
2009
13 years 6 months ago
2009
This paper presents a new approach to selecting the initial seed set using stratified sampling strategy in bootstrapping-based semi-supervised learning for semantic relation class...
VC
2011
13 years 4 months ago
2011
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
TII
2010
13 years 3 months ago
2010
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...