Sciweavers

1312 search results - page 133 / 263
» Formally Optimal Boxing
Sort
View
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
14 years 1 months ago
The no free lunch and realistic search algorithms
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
Yossi Borenstein, Riccardo Poli
ICML
1994
IEEE
14 years 1 months ago
Markov Games as a Framework for Multi-Agent Reinforcement Learning
In the Markov decision process (MDP) formalization of reinforcement learning, a single adaptive agent interacts with an environment defined by a probabilistic transition function....
Michael L. Littman
CIKM
2008
Springer
13 years 11 months ago
Pruning nested XQuery queries
We present in this paper an approach for XQuery optimization that exploits minimization opportunities raised in composition-style nesting of queries. More precisely, we consider t...
Bilel Gueni, Talel Abdessalem, Bogdan Cautis, Emma...
EUROGP
2008
Springer
137views Optimization» more  EUROGP 2008»
13 years 11 months ago
A Comparison of Cartesian Genetic Programming and Linear Genetic Programming
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
Garnett Carl Wilson, Wolfgang Banzhaf
BDA
2007
13 years 11 months ago
Pattern by Example: type-driven visual programming of XML queries
We present Pattern-by-Example (PBE), a graphical language that allows users with little or no knowledge of pattern-matching and functional programming to define complex and optim...
Véronique Benzaken, Giuseppe Castagna, Dari...