2698 search results - page 230 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
173
click to vote
FLAIRS
2004
15 years 8 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
182
click to vote
RECOMB
1997
Springer
15 years 10 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
173
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
179
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
285
click to vote
VLDB
2006
ACM
16 years 6 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...