3874 search results - page 264 / 775 » Approximation Algorithms for k-hurdle Problems |
126
click to vote
ICAI
2009
15 years 2 months ago
2009
- We address the issues of improving the feature generation methods for the value-function approximation and the state space approximation. We focus the improvement of feature gene...
193
click to vote
WG
2004
Springer
15 years 9 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
146
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
137
click to vote
BICOB
2009
Springer
15 years 11 months ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
127
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...