297 search results - page 24 / 60 » Every Sequence Is Decompressible from a Random One |
IJCAI
1989
15 years 6 days ago
1989
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...
75
Voted
BMCBI
2007
14 years 11 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
STOC
1993
ACM
15 years 3 months ago
1993
ACM
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
111
click to vote
ASPLOS
2008
ACM
15 years 1 months ago
2008
ACM
The reality of multi-core hardware has made concurrent programs pervasive. Unfortunately, writing correct concurrent programs is difficult. Addressing this challenge requires adva...
CSREASAM
2006
15 years 13 days ago
2006
: The research work in this paper shows that the currently available stenographic methods might be quite easily detected by using sufficiently careful analysis of the transmitted d...