2393 search results - page 281 / 479 » Bounds-Consistent Local Search |
123
Voted
JMLR
2008
15 years 3 months ago
2008
In this paper, we propose a recursive method for structural learning of directed acyclic graphs (DAGs), in which a problem of structural learning for a large DAG is first decompos...
112
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. ...
121
Voted
TCBB
2008
15 years 3 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
112
Voted
ANOR
2002
15 years 3 months ago
2002
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
119
click to vote
DEBU
1998
15 years 3 months ago
1998
The amount of information available online has grown enormously over the past decade. Fortunately, computing power, disk capacity, and network bandwidth have also increased dramat...