2168 search results - page 347 / 434 » Randomized Algorithms and Complexity Theory |
180
click to vote
POPL
2003
ACM
16 years 3 months ago
2003
ACM
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
112
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
145
click to vote
PODS
2008
ACM
16 years 3 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
103
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— Symbolic models are abstract descriptions of continuous systems in which symbols represent aggregates of continuous states. In the last few years there has been a growi...
114
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Tournament selection has been widely used and studied in evolutionary algorithms. To supplement the study of tournament selection, this paper provides several models describing th...