Sciweavers

464 search results - page 26 / 93
» Memory Based on Abstraction for Dynamic Fitness Functions
Sort
View
62
Voted
GECCO
2003
Springer
114views Optimization» more  GECCO 2003»
15 years 2 months ago
Learning the Ideal Evaluation Function
Abstract. Designing an adequate fitness function requiressubstantial knowledge of a problem and of features that indicate progress towards a solution. Coevolution takes the human ...
Edwin D. de Jong, Jordan B. Pollack
COMPGEOM
2006
ACM
15 years 1 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
TSMC
2008
102views more  TSMC 2008»
14 years 9 months ago
Generalized Cost-Function-Based Forecasting for Periodically Measured Nonstationary Traffic
Abstract-- In this paper, we address the issue of forecasting for periodically measured nonstationary traffic based on statistical time series modeling. Often with time series base...
Balaji Krithikaivasan, Yong Zeng, Deep Medhi
137
Voted
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
15 years 9 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
AMAST
2004
Springer
15 years 3 months ago
Separate Compositional Analysis of Class-Based Object-Oriented Languages
Abstract. We present a separate compositional analysis for objectoriented languages. We show how a generic static analysis of a context that uses an object can be split into two se...
Francesco Logozzo