Sciweavers

670 search results - page 60 / 134
» Inclusion-Based Approximate Reasoning
Sort
View
NIPS
2007
13 years 9 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 8 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
FUIN
2010
143views more  FUIN 2010»
13 years 5 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
IJAR
2008
118views more  IJAR 2008»
13 years 7 months ago
Dynamic multiagent probabilistic inference
Cooperative multiagent probabilistic inference can be applied in areas such as building surveillance and complex system diagnosis to reason about the states of the distributed unc...
Xiangdong An, Yang Xiang, Nick Cercone
GIS
2010
ACM
13 years 5 months ago
Tolerance geometry: Euclid's first postulate for points and lines with extension
Object representation and reasoning in vector based geographic information systems (GIS) is based on Euclidean geometry. Euclidean geometry is built upon Euclid's first postu...
Gwen Wilke, Andrew U. Frank