2446 search results - page 436 / 490 » Choiceless Polynomial Time |
ALGORITHMICA
2007
13 years 7 months ago
2007
— We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequen...
CN
2008
13 years 7 months ago
2008
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In 1992, Bartholdi, Tovey, and Trick [1992] opened the study of control attacks on elections--attempts to improve the election outcome by such actions as adding/deleting candidate...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...