Sciweavers

9359 search results - page 241 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
POPL
2009
ACM
16 years 5 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander
SIGIR
2005
ACM
15 years 10 months ago
Measure-based metasearch
We propose a simple method for converting many standard measures of retrieval performance into metasearch algorithms. Our focus is both on the analysis of retrieval measures thems...
Javed A. Aslam, Virgiliu Pavlu, Emine Yilmaz
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 8 months ago
Inside a predator-prey model for multi-objective optimization: a second study
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
Christian Grimme, Karlheinz Schmitt
ATAL
2008
Springer
15 years 7 months ago
Emerging coordination in infinite team Markov games
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
Francisco S. Melo, M. Isabel Ribeiro
152
Voted
NIPS
2001
15 years 6 months ago
The Concave-Convex Procedure (CCCP)
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
Alan L. Yuille, Anand Rangarajan