Sciweavers

7504 search results - page 193 / 1501
» Computing with Action Potentials
Sort
View
IJCAI
2003
13 years 9 months ago
A lookahead strategy for solving large planning problems
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Vincent Vidal
CVPR
2010
IEEE
14 years 4 months ago
Energy Minimization for Linear Envelope MRFs
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...
Pushmeet Kohli, M. Pawan Kumar
AIMS
2010
Springer
14 years 1 days ago
Probabilistic Fault Diagnosis in the MAGNETO Autonomic Control Loop
Management of outer edge domains is a big challenge for service providers due to the diversity, heterogeneity and large amount of such networks, together with limited visibility on...
Pablo Arozarena, Raquel Toribio, Jesse Kielthy, Ke...
FOCS
1998
IEEE
13 years 11 months ago
Recommendation Systems: A Probabilistic Analysis
A recommendation system tracks past actions of a group of users to make recommendations toindividualmembersofthe group. The growth ofcomputer-mediatedmarketingandcommerce has led ...
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopala...
EVOW
2010
Springer
13 years 11 months ago
On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme
Divide-and-Evolve (DaE) is an original "memeticization" of Evolutionary Computation and Artificial Intelligence Planning. DaE optimizes either the number of actions, or t...
Jacques Bibai, Pierre Savéant, Marc Schoena...