1402 search results - page 51 / 281 » Searching Cycle-Disjoint Graphs |
118
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
128
click to vote
HEURISTICS
2008
15 years 4 months ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
133
click to vote
SIGIR
2010
ACM
15 years 8 months ago
2010
ACM
Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as que...
150
click to vote
AIPS
2000
15 years 5 months ago
2000
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
123
click to vote
ICWS
2008
IEEE
15 years 5 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...