Sciweavers

44 search results - page 8 / 9
» Predicting Partial Paths from Planning Problem Parameters
Sort
View
HRI
2007
ACM
13 years 9 months ago
Efficient model learning for dialog management
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
Finale Doshi, Nicholas Roy
FCT
2003
Springer
13 years 10 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
SIGCOMM
2012
ACM
11 years 8 months ago
Route shepherd: stability hints for the control plane
The Route Shepherd tool demonstrates applications of choosing between routing protocol configurations on the basis of rigorouslysupported theory. Splitting the configuration spa...
Alexander J. T. Gurney, Xianglong Han, Yang Li, Bo...
CVPR
2008
IEEE
14 years 7 months ago
Object tracking and detection after occlusion via numerical hybrid local and global mode-seeking
Given an object model and a black-box measure of similarity between the model and candidate targets, we consider visual object tracking as a numerical optimization problem. During...
Zhaozheng Yin, Robert T. Collins
COR
2010
110views more  COR 2010»
13 years 5 months ago
An evolutionary method for complex-process optimization
In this paper we present a new evolutionary method for complex-process optimization. It is partially based on principles of the scatter search methodology, but it makes use of inn...
Jose A. Egea, Rafael Martí, Julio R. Banga