Sciweavers

242 search results - page 16 / 49
» Provably Bounded Optimal Agents
Sort
View
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
14 years 18 days ago
Shortest path optimization under limited information
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
Michael Rinehart, Munther A. Dahleh
ICCD
1997
IEEE
100views Hardware» more  ICCD 1997»
14 years 2 days ago
Optimal Clock Period Clustering for Sequential Circuits with Retiming
Abstract— In this paper we consider the problem of clustering sequential circuits subject to a bound on the area of each cluster, with the objective of minimizing the clock perio...
Arvind K. Karandikar, Peichen Pan, C. L. Liu
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 8 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
ECAI
2008
Springer
13 years 9 months ago
Dynamic Backtracking for Distributed Constraint Optimization
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
Redouane Ezzahir, Christian Bessiere, Imade Benela...
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 8 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis