Sciweavers

16404 search results - page 319 / 3281
» A set coverage problem
Sort
View
ICCV
2003
IEEE
15 years 10 months ago
Unsupervised Non-parametric Region Segmentation Using Level Sets
We present a novel non-parametric unsupervised segmentation algorithm based on Region Competition [21]; but implemented within a Level Sets framework [11]. The key novelty of the ...
Timor Kadir, Michael Brady
COCOON
2003
Springer
15 years 10 months ago
Finding Hidden Independent Sets in Interval Graphs
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
Therese C. Biedl, Brona Brejová, Erik D. De...
ICLP
2003
Springer
15 years 10 months ago
Computing Minimal Models, Stable Models, and Answer Sets
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
Zbigniew Lonc, Miroslaw Truszczynski
PODC
2010
ACM
15 years 8 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
GECCO
2006
Springer
186views Optimization» more  GECCO 2006»
15 years 8 months ago
Genetic algorithms for action set selection across domains: a demonstration
Action set selection in Markov Decision Processes (MDPs) is an area of research that has received little attention. On the other hand, the set of actions available to an MDP agent...
Greg Lee, Vadim Bulitko