Sciweavers

1484 search results - page 71 / 297
» Ants meeting algorithms
Sort
View
ICDCS
1992
IEEE
14 years 2 months ago
End-to-End Scheduling to Meet Deadlines in Distributed Systems
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...
Riccardo Bettati, Jane W.-S. Liu
ICML
2003
IEEE
14 years 11 months ago
Bayes Meets Bellman: The Gaussian Process Approach to Temporal Difference Learning
We present a novel Bayesian approach to the problem of value function estimation in continuous state spaces. We define a probabilistic generative model for the value function by i...
Yaakov Engel, Shie Mannor, Ron Meir
GI
2007
Springer
14 years 4 months ago
Test Automation Meets Static Analysis
: In this article we advocate an integrated approach for the automation of module or software integration testing and static analysis. It is illustrated how funmethods of static an...
Jan Peleska, Helge Löding, Tatiana Kotas
NOSSDAV
1995
Springer
14 years 1 months ago
Meeting Arbitrary QoS Constraints Using Dynamic Rate Shaping of Coded Digital Video
Abstract. We introduce the concept of Dynamic Rate Shaping, a technique to adapt the rate ofcompressed video bitstreams MPEG-1, MPEG2, H.261, as well as JPEG to dynamically varyi...
Alexandros Eleftheriadis, Dimitris Anastassiou
PERVASIVE
2008
Springer
13 years 10 months ago
Microsearch: When Search Engines Meet Small Devices
Abstract. In this paper, we present Microsearch, a search system suitable for small devices used in ubiquitous computing environments. Akin to a desktop search engine, Microsearch ...
Chiu Chiang Tan, Bo Sheng, Haodong Wang, Qun Li