425 search results - page 13 / 85 » On the additive constant of the k-server Work Function Algor... |
126
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
142
Voted
DAC
2007
ACM
16 years 4 months ago
2007
ACM
In the paper, we propose a new metric for the minimization of area in the generic problem of multiple constant multiplications, and demonstrate its effectiveness for digital FIR f...
153
Voted
ESA
1993
Springer
15 years 7 months ago
1993
Springer
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
168
Voted
TCS
2011
14 years 10 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
113
Voted
EVOW
2003
Springer
15 years 8 months ago
2003
Springer
This paper discusses the motivation, design and construction of a generative music system, 'MusicBlox', (by the author) that utilises a domain specific, knowledge rich Ge...