2485 search results - page 198 / 497 » Time Bounded Frequency Computations |
160
click to vote
WAOA
2004
Springer
15 years 12 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
184
click to vote
PEPM
2009
ACM
16 years 3 months ago
2009
ACM
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...
189
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
174
click to vote
IEEEPACT
1998
IEEE
15 years 10 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
163
click to vote
HPDC
2007
IEEE
16 years 26 days ago
2007
IEEE
We study stochastic models to mitigate the risk of poor Quality-of-Service (QoS) in computational markets. Consumers who purchase services expect both price and performance guaran...