16404 search results - page 261 / 3281 » A set coverage problem |
122
click to vote
ACL
2006
15 years 5 months ago
2006
We present the implementation of a system which extracts not only lexicalized grammars but also feature-based lexicalized grammars from Korean Sejong Treebank. We report on some p...
113
click to vote
AMC
2008
15 years 4 months ago
2008
We present three new stopping rules for Multistart based methods. The first uses a device that enables the determination of the coverage of the bounded search domain. The second i...
126
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This poster paper addresses the problem of choosing sets of software components to combine in component
115
click to vote
TCS
2002
15 years 4 months ago
2002
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
152
click to vote
NETWORKS
2010
15 years 2 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...