2374 search results - page 397 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
MIDDLEWARE
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we consider the problem of maximising utility in linked market-driven distributed and Grid systems. In such systems, users submit jobs through brokers who can virtua...
106
click to vote
JCB
2002
14 years 9 months ago
2002
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
MOBIHOC
2006
ACM
15 years 3 months ago
2006
ACM
A large number of practical sensing and actuating applications require immediate notification of rare but urgent events and also fast delivery of time sensitive actuation command...
IEEEPACT
2006
IEEE
15 years 3 months ago
2006
IEEE
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...