Sciweavers

5580 search results - page 669 / 1116
» Randomized priority algorithms
Sort
View
IROS
2008
IEEE
121views Robotics» more  IROS 2008»
15 years 11 months ago
Online ZMP sampling search for biped walking planning
— In this paper, we present a new method that uses random search for online planning of biped walking, given a feasible footstep plan. The Linear Inverted Pendulum dynamic model ...
Jinsu Liu, Manuela M. Veloso
ASIAMS
2007
IEEE
15 years 10 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
CEC
2007
IEEE
15 years 10 months ago
Towards an immune system that solves CSP
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
María-Cristina Riff, Marcos Zú&ntild...
IROS
2007
IEEE
157views Robotics» more  IROS 2007»
15 years 10 months ago
A spatio-temporal probabilistic model for multi-sensor object recognition
— This paper presents a general framework for multi-sensor object recognition through a discriminative probabilistic approach modelling spatial and temporal correlations. The alg...
Bertrand Douillard, Dieter Fox, Fabio T. Ramos
PDP
2007
IEEE
15 years 10 months ago
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
Andreas Beckmann, Jorg Keller