994 search results - page 110 / 199 » Custom Computing Machines for the Set Covering Problem |
ICCAD
2005
IEEE
15 years 9 months 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...
103
Voted
AUTOMATICA
2006
15 years 19 days 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...
116
Voted
WWW
2007
ACM
16 years 1 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...
130
Voted
FOSSACS
2007
Springer
15 years 4 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...
122
Voted
ICCV
2011
IEEE
13 years 6 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...