Sciweavers

178 search results - page 31 / 36
» combinatorics 2007
Sort
View
IJCAI
2003
13 years 11 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
DAGSTUHL
1990
13 years 11 months ago
Parallel Rule-Firing Production Systems
One of the principal advantages of parallelizing a rule-based system, or more generally, any A.I. system, is the ability to pursue alternate search paths concurrently. Conventiona...
Daniel Neimann
ECCC
2007
100views more  ECCC 2007»
13 years 9 months ago
Unconditional pseudorandom generators for low degree polynomials
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
Shachar Lovett
COCOON
2007
Springer
14 years 4 months ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
14 years 4 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield