Sciweavers

1019 search results - page 94 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
ICWMC
2006
IEEE
14 years 2 months ago
Mobility Models for UAV Group Reconnaissance Applications
In MANET research the mobility of the nodes is often described using standard synthetic models. Given a particular application, e.g. networks of unmanned aerial vehicles (UAVs) pe...
Erik Kuiper, Simin Nadjm-Tehrani
INTERSPEECH
2010
13 years 3 months ago
Hierarchical bottle neck features for LVCSR
This paper investigates the combination of different neural network topologies for probabilistic feature extraction. On one hand, a five-layer neural network used in bottle neck f...
Christian Plahl, Ralf Schlüter, Hermann Ney
ICRA
2009
IEEE
152views Robotics» more  ICRA 2009»
14 years 3 months ago
Reachability-guided sampling for planning under differential constraints
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
Alexander C. Shkolnik, Matthew Walter, Russ Tedrak...
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
14 years 2 months ago
Planning with Continuous Actions in Partially Observable Environments
Abstract— We present a simple randomized POMDP algorithm for planning with continuous actions in partially observable environments. Our algorithm operates on a set of reachable b...
Matthijs T. J. Spaan, Nikos A. Vlassis
IJCSA
2007
104views more  IJCSA 2007»
13 years 8 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala