2745 search results - page 461 / 549 » A fast algorithm for computing large Fibonacci numbers |
127
click to vote
DSOM
2003
Springer
15 years 9 months ago
2003
Springer
One of the main problems with today's Internet traffic analysis is caused by the large number of network-based applications whose types and traffic patterns are more complicat...
128
click to vote
RTSS
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper we propose a novel scheduling framework for a real-timeenvironmentthat experiences dynamic changes. Thisframework is capable of adjusting the system workload in incr...
191
click to vote
INFOCOM
1997
IEEE
15 years 8 months ago
1997
IEEE
The CARMA-NTG protocol is presented and analyzed. CARMA-NTG dynamically divides the channel into cycles of variable length; each cycle consists of a contention period and a group-...
103
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...
129
click to vote
AAAI
1998
15 years 5 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...