2254 search results - page 231 / 451 » Computing the minimal covering set |
199
click to vote
ISMVL
2008
IEEE
16 years 1 months ago
2008
IEEE
Compact realizations of reversible logic functions are of interest in the design of quantum computers. In this paper we present an exact synthesis algorithm, based on Boolean Sati...
201
click to vote
ECRTS
2006
IEEE
16 years 21 days ago
2006
IEEE
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...
176
click to vote
ADHOCNOW
2005
Springer
16 years 6 days ago
2005
Springer
— In this paper, we address an optimization problem that arises in context of cache placement in sensor networks. In particular, we consider the cache placement problem where the...
186
click to vote
EMMCVPR
2005
Springer
16 years 5 days ago
2005
Springer
In many biomedical imaging applications, video sequences are captured with low resolution and low contrast challenging conditions in which to detect, segment, or track features. Wh...
158
click to vote
ICTCS
2005
Springer
16 years 4 days ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...