Sciweavers

914 search results - page 62 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
CVPR
2008
IEEE
15 years 23 days ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
ICRA
2006
IEEE
118views Robotics» more  ICRA 2006»
14 years 4 months ago
Symbolic Control for Underactuated Differentially Flat Systems
— In this paper we address the problem of generating input plans to steer complex dynamical systems in an obstaclefree environment. Plans considered admit a finite description l...
Adriano Fagiolini, Luca Greco, Antonio Bicchi, Ben...
JSAT
2006
126views more  JSAT 2006»
13 years 10 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
IWCMC
2006
ACM
14 years 4 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan
VAST
2004
ACM
14 years 4 months ago
A Point-Based Approach for Capture, Display and Illustration of Very Complex Archeological Artefacts
In this paper we present a complete point-based pipeline for the capture, display and illustration of very large scans of archeological artifacts. This approach was developed as p...
Florent Duguet, George Drettakis, Daniel Girardeau...