Sciweavers

1026 search results - page 11 / 206
» On Finding Minimal w-cutset
Sort
View
IAT
2008
IEEE
14 years 2 months ago
Finding Minimum Data Requirements Using Pseudo-independence
In situations where Bayesian networks (BN) inferencing approximation is allowable, we show how to reduce the amount of sensory observations necessary and in a multi-agent context ...
Yoonheui Kim, Victor R. Lesser
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
14 years 1 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
KSEM
2007
Springer
14 years 1 months ago
Finding Similar RSS News Articles Using Correlation-Based Phrase Matching
Traditional phrase matching approaches, which can discover documents containing exactly the same phrases, fail to detect documents including phrases that are semantically relevant,...
Maria Soledad Pera, Yiu-Kai Ng
ICRA
2003
IEEE
129views Robotics» more  ICRA 2003»
14 years 1 months ago
Optimal navigation and object finding without geometric maps or localization
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
Benjamín Tovar, Steven M. LaValle, Rafael M...
MICS
2010
137views more  MICS 2010»
13 years 6 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun