409 search results - page 81 / 82 » Matching Scenarios with Timing Constraints |
WECWIS
2002
IEEE
15 years 2 months ago
2002
IEEE
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
CC
2009
Springer
15 years 2 months ago
2009
Springer
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...
75
Voted
SIGMOD
1999
ACM
15 years 1 months ago
1999
ACM
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
103
click to vote
STACS
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
VLDB
1998
ACM
15 years 1 months ago
1998
ACM
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...