Sciweavers

1173 search results - page 41 / 235
» Program Derivation Using Analogy
Sort
View
115
Voted
WCAE
2006
ACM
15 years 8 months ago
Experiences with the Blackfin architecture in an embedded systems lab
At Northeastern University we are building a number of courses upon a common embedded systems platform. The goal is to reduce the learning curve associated with new architectures ...
Michael G. Benjamin, David R. Kaeli, Richard Platc...
POPL
2000
ACM
15 years 6 months ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini
104
Voted
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
16 years 2 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
124
Voted
GECCO
2009
Springer
145views Optimization» more  GECCO 2009»
15 years 8 months ago
Geometric differential evolution
Geometric Particle Swarm Optimization (GPSO) is a recently introduced formal generalization of traditional Particle Swarm Optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Julian Togelius
92
Voted
EXPERT
2008
108views more  EXPERT 2008»
15 years 2 months ago
Case-Based Plan Adaptation: An Analysis and Review
: In this article we analyze the current state of case-based plan adaptation research. We include the traditional distinction between transformational and derivational analogy but ...
Héctor Muñoz-Avila, Michael T. Cox