Sciweavers

408 search results - page 48 / 82
» A lookahead strategy for solving large planning problems
Sort
View
ECCV
2008
Springer
15 years 11 months ago
Continuous Energy Minimization Via Repeated Binary Fusion
Abstract. Variational problems, which are commonly used to solve lowlevel vision tasks, are typically minimized via a local, iterative optimization strategy, e.g. gradient descent....
Werner Trobin, Thomas Pock, Daniel Cremers, Horst ...
ICSE
1989
IEEE-ACM
15 years 1 months ago
The Inscape Environment
The Inscape Environment is an integrated software development enviroment for building large software systems by large groups of developers. It provides tools that are knowledgeabl...
Dewayne E. Perry
ATAL
2007
Springer
15 years 3 months ago
Convergence and rate of convergence of a simple ant model
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
Amine M. Boumaza, Bruno Scherrer
85
Voted
CCGRID
2010
IEEE
14 years 7 months ago
Overdimensioning for Consistent Performance in Grids
Grid users may experience inconsistent performance due to specific characteristics of grids, such as fluctuating workloads, high failure rates, and high resource heterogeneity. Alt...
Nezih Yigitbasi, Dick H. J. Epema
IJCAI
2003
14 years 11 months ago
Point-based value iteration: An anytime algorithm for POMDPs
This paper introduces the Point-Based Value Iteration (PBVI) algorithm for POMDP planning. PBVI approximates an exact value iteration solution by selecting a small set of represen...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun