1566 search results - page 84 / 314 » On a Cone Covering Problem |
144
click to vote
DAC
1994
ACM
15 years 10 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 ...
192
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
169
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
163
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
While classical kernel-based classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. ...
160
click to vote
IROS
2007
IEEE
16 years 17 days ago
2007
IEEE
Abstract— In this paper, we present an optimization framework for target tracking with mobile robot teams. The target tracking problem is modeled as a generic semidefinite progr...