8413 search results - page 184 / 1683 » Ordering Problem Subgoals |
PROCEDIA
2011
13 years 1 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
EMMCVPR
2011
Springer
12 years 10 months ago
2011
Springer
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
ICDE
2008
IEEE
15 years 3 days ago
2008
IEEE
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...
FASE
2009
Springer
14 years 3 months ago
2009
Springer
In order to retrieve, select and apply design patterns in a tool-supported way, we suggest to construct and document a problemcontext pattern that reflects the essence of the prob...
EVOW
2001
Springer
14 years 3 months ago
2001
Springer
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...