2254 search results - page 217 / 451 » Computing the minimal covering set |
176
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
169
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— We describe a method for an autonomous robot to efficiently locate one or more distinct objects in a realistic environment using monocular vision. We demonstrate how to effic...
197
click to vote
CSCLP
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
175
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
174
click to vote
WADS
2007
Springer
16 years 23 days ago
2007
Springer
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...