Sciweavers

2905 search results - page 326 / 581
» Formal Memetic Algorithms
Sort
View
118
Voted
ISSS
2000
IEEE
111views Hardware» more  ISSS 2000»
15 years 8 months ago
Systematic Data Reuse Exploration Methodology for Irregular Access Patterns
Efficient use of an optimized custom memory hierarchy to exploit temporal locality in the memory accesses on array signals can have a very large impact on the power consumption i...
Tanja Van Achteren, Rudy Lauwereins, Francky Catth...
RTCSA
2000
IEEE
15 years 8 months ago
Tracking Real-Time Systems Requirements
One of the hard problems in maintaining real-time systems requirements is to keep track of the impact of resource usage on the applications. Often times, it is not sufficient to ...
Aloysius K. Mok
131
Voted
COLT
2000
Springer
15 years 8 months ago
Bias-Variance Error Bounds for Temporal Difference Updates
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
Michael J. Kearns, Satinder P. Singh
PODS
1999
ACM
89views Database» more  PODS 1999»
15 years 8 months ago
Type Inference in the Polymorphic Relational Algebra
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
Jan Van den Bussche, Emmanuel Waller
116
Voted
SPIRE
1999
Springer
15 years 8 months ago
Cross-Domain Approximate String Matching
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
Daniel P. Lopresti, Gordon T. Wilfong