Sciweavers

15073 search results - page 353 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
ICML
2009
IEEE
16 years 5 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint
ICASSP
2011
IEEE
14 years 8 months ago
Outlier-aware robust clustering
Clustering is a basic task in a variety of machine learning applications. Partitioning a set of input vectors into compact, wellseparated subsets can be severely affected by the p...
Pedro A. Forero, Vassilis Kekatos, Georgios B. Gia...
117
Voted
ERSA
2006
132views Hardware» more  ERSA 2006»
15 years 6 months ago
Combinatorial Optimization in Mapping Generalized Template Matching onto Reconfigurable Computers
: A brief review of mapping generalized template matching operations onto reconfigurable computers is given. A combinatorial optimization process, where the objective is to minimiz...
Xuejun Liang, Qutaibah M. Malluhi
177
Voted
UC
2005
Springer
15 years 10 months ago
Using Genetic Algorithms to Evolve Behavior in Cellular Automata
Abstract. It is an unconventional computation approach to evolve solutions instead of calculating them. Although using evolutionary computation in computer science dates back to th...
Thomas Bäck, Ron Breukelaar
AAAI
2012
13 years 7 months ago
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
Joshua Letchford, Liam MacDermed, Vincent Conitzer...