2254 search results - page 14 / 451 » Computing the minimal covering set |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...
HRI
2010
ACM
14 years 4 months ago
2010
ACM
—Managing user expectations of personal robots becomes particularly challenging when the end-user just wants to know what the robot can do, and neither understands nor cares abou...
DAC
1994
ACM
14 years 1 months ago
1994
ACM
State minimization of incompletely specifiedmachinesis an important step of FSM synthesis. An exact algorithm consists of generation of prime compatibles and solution of a binate ...
Presentation
A nice presentation by Daniel Cremers at the European Conference on Computer Vision (ECCV) 2006, covering a wide range of computer vision applications that the level set methods ca...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...