Sciweavers

328 search results - page 57 / 66
» Deterministic k-set structure
Sort
View
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
13 years 10 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
ANCS
2007
ACM
13 years 10 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
AIPS
1998
13 years 8 months ago
Solving Stochastic Planning Problems with Large State and Action Spaces
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
Thomas Dean, Robert Givan, Kee-Eung Kim
BIRTHDAY
2010
Springer
13 years 7 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
DT
2006
98views more  DT 2006»
13 years 6 months ago
Handling variations and uncertainties
The widely used engineering decisions concerning the performance of technological equipment for process industries are usually deterministic. Since the early 1990s probabilistic m...
Tim Cheng