Sciweavers

6943 search results - page 757 / 1389
» Representations for evolutionary algorithms
Sort
View
SGAI
2010
Springer
15 years 5 months ago
Hierarchical Traces for Reduced NSM Memory Requirements
This paper presents work on using hierarchical long term memory to reduce the memory requirements of nearest sequence memory (NSM) learning, a previously published, instance-based ...
Torbjørn S. Dahl
GI
2009
Springer
15 years 5 months ago
Test your Strategy - Intuitive Strategy Definition and Evaluation for Novices and Experts
: ConnectIT uses a graphical representation to express strategies for playing the connect-four game. With this tool we can transfer complex knowledge about the connect-four game it...
Sven Jörges, Marco Bakera, Tiziana Margaria, ...
252
Voted
MCS
2011
Springer
15 years 2 months ago
The geometry and dynamics of binary trees
: The modeling of a fully populated 3D tree able to regulate dynamically remains a relatively unexplored field. A non-dimensional representation of “autoregulation” coupled wit...
T. David, Thomas van Kempen, Huaxiong Huang, Phill...
207
Voted
JMLR
2010
137views more  JMLR 2010»
15 years 2 months ago
HOP-MAP: Efficient Message Passing with High Order Potentials
There is a growing interest in building probabilistic models with high order potentials (HOPs), or interactions, among discrete variables. Message passing inference in such models...
Daniel Tarlow, Inmar Givoni, Richard S. Zemel
JSC
2010
82views more  JSC 2010»
15 years 2 months ago
The first rational Chebyshev knots
A Chebyshev knot C(a, b, c, ) is a knot which has a parametrization of the form x(t) = Ta(t); y(t) = Tb(t); z(t) = Tc(t + ), where a, b, c are integers, Tn(t) is the Chebyshev pol...
Pierre-Vincent Koseleff, D. Pecker, F. Rouillier