923 search results - page 176 / 185 » Proving the value of formal methods |
120
click to vote
VLDB
2005
ACM
15 years 7 months ago
2005
ACM
Emerging data stream management systems approach the challenge of massive data distributions which arrive at high speeds while there is only small storage by summarizing and minin...
135
click to vote
LCPC
2009
Springer
15 years 6 months ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
114
Voted
AIPS
2000
15 years 3 months ago
2000
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
131
Voted
JMLR
2006
15 years 1 months ago
2006
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
215
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...