Sciweavers

248 search results - page 16 / 50
» A Functional Representation of Data Structures with a Hole
Sort
View
NIPS
2001
14 years 11 months ago
Predictive Representations of State
We show that states of a dynamical system can be usefully represented by multi-step, action-conditional predictions of future observations. State representations that are grounded...
Michael L. Littman, Richard S. Sutton, Satinder P....
80
Voted
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
15 years 10 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
15 years 3 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler
ICSE
1997
IEEE-ACM
15 years 1 months ago
Lackwit: A Program Understanding Tool Based on Type Inference
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
Robert O'Callahan, Daniel Jackson
GECCO
2003
Springer
123views Optimization» more  GECCO 2003»
15 years 2 months ago
Benefits of Implicit Redundant Genetic Algorithms for Structural Damage Detection in Noisy Environments
A robust structural damage detection method that can handle noisy frequency response function information is discussed. The inherent unstructured nature of damage detection problem...
Anne M. Raich, Tamás Liszkai