13841 search results - page 2442 / 2769 » Algorithms and Constraint Programming |
129
click to vote
COMBINATORICA
2008
15 years 4 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
161
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
162
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Compressive sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable, sub-N...
119
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
133
click to vote
IJAIT
2008
15 years 4 months ago
2008
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technolo...