562 search results - page 105 / 113 » An Analysis of Transformational Analogy: General Framework a... |
SPAA
2010
ACM
13 years 8 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...
CHARME
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
WSDM
2010
ACM
14 years 5 months ago
2010
ACM
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...