16404 search results - page 176 / 3281 » A set coverage problem |
108
Voted
CSL
2004
Springer
15 years 9 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
98
Voted
AIPS
2000
15 years 4 months ago
2000
Classical propositional STRIPSplanning is nothing but the searchfor a path in the state-transition graph induced by the operators in the planning problem. Whatmakes the problem ha...
109
Voted
DAM
2000
15 years 3 months ago
2000
An irredundant set of vertices V V in a graph G = (V; E) has the property that for every vertex u V ; N[V - {u}] is a proper subset of N[V ]. We investigate the parameterized co...
141
Voted
SCALESPACE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Segmentation of images is often posed as a variational problem. As such, it is solved by formulating an energy functional depending on a contour and other image derived t...
127
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...