Sciweavers

492 search results - page 44 / 99
» Empirical Comparison of
Sort
View
WEA
2004
Springer
110views Algorithms» more  WEA 2004»
15 years 11 months ago
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
David J. Pearce, Paul H. J. Kelly
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 9 months ago
gLINC: identifying composability using group perturbation
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
David Jonathan Coffin, Christopher D. Clack
INFOCOM
1995
IEEE
15 years 9 months ago
Measuring the Performance of Parallel Message-Based Process Architectures
Message-based process architectures are widely regarded as an effective method for structuring parallel protocol processing on shared memory multi-processor platforms. A message-b...
Douglas C. Schmidt, Tatsuya Suda
NIPS
2008
15 years 7 months ago
Simple Local Models for Complex Dynamical Systems
We present a novel mathematical formalism for the idea of a "local model" of an uncontrolled dynamical system, a model that makes only certain predictions in only certai...
Erik Talvitie, Satinder Singh
AAAI
2004
15 years 7 months ago
Machine Learning for Fast Quadrupedal Locomotion
For a robot, the ability to get from one place to another is one of the most basic skills. However, locomotion on legged robots is a challenging multidimensional control problem. ...
Nate Kohl, Peter Stone