Sciweavers

4370 search results - page 381 / 874
» Algebra of Logic Programming
Sort
View
118
Voted
TACS
2001
Springer
15 years 7 months ago
Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness
Abstract. We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and the...
Hiroshi Nakano
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 10 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
125
Voted
GECCO
2006
Springer
150views Optimization» more  GECCO 2006»
15 years 7 months ago
Nonlinear parametric regression in genetic programming
Genetic programming has been considered a promising approach for function approximation since it is possible to optimize both the functional form and the coefficients. However, it...
Yung-Keun Kwon, Sung-Soon Choi, Byung Ro Moon
CIDR
2009
181views Algorithms» more  CIDR 2009»
15 years 4 months ago
The Case for RodentStore: An Adaptive, Declarative Storage System
Recent excitement in the database community surrounding new applications--analytic, scientific, graph, geospatial, etc.--has led to an explosion in research on database storage sy...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
PPDP
2000
Springer
15 years 6 months ago
Declarative event-oriented programming
Events play an important role in the construction of most software that involves interaction or simulation. Typically, programmers make use of a fixed set of low level events supp...
Conal Elliott