994 search results - page 110 / 199 » Custom Computing Machines for the Set Covering Problem |
101
click to vote
ICCAD
2005
IEEE
16 years 19 hour ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
223
click to vote
AUTOMATICA
2006
15 years 3 months ago
2006
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
132
click to vote
WWW
2007
ACM
16 years 3 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
153
click to vote
FOSSACS
2007
Springer
15 years 7 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
148
click to vote
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
Detecting abnormalities in video is a challenging problem since the class of all irregular objects and behaviors is infinite and thus no (or by far not enough) abnormal training sa...