Sciweavers

1484 search results - page 125 / 297
» Ants meeting algorithms
Sort
View
ICDCS
1995
IEEE
15 years 1 months ago
Analysis of Resource Lower Bounds in Real-Time Applications
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...
Raed Alqadi, Parameswaran Ramanathan
APNOMS
2008
Springer
15 years 13 hour ago
A Hop by Hop Rate Control Based QoS Management for Real Time Traffic in Wireless Sensor Networks
Wireless Sensor Network typically assimilates various real time applications that must meet some QoS requirements (e.g. delay, jitter, throughput, packet loss) under severe resourc...
Muhammad Mostafa Monowar, Md. Obaidur Rahman, Byun...
DCC
2007
IEEE
15 years 9 months ago
High Throughput Compression of Double-Precision Floating-Point Data
This paper describes FPC, a lossless compression algorithm for linear streams of 64-bit floating-point data. FPC is designed to compress well while at the same time meeting the hi...
Martin Burtscher, Paruj Ratanaworabhan
AIPS
2011
14 years 1 months ago
Sample-Based Planning for Continuous Action Markov Decision Processes
In this paper, we present a new algorithm that integrates recent advances in solving continuous bandit problems with sample-based rollout methods for planning in Markov Decision P...
Christopher R. Mansley, Ari Weinstein, Michael L. ...
CORR
2010
Springer
85views Education» more  CORR 2010»
14 years 10 months ago
A control-theoretical methodology for the scheduling problem
This paper presents a novel methodology to develop scheduling algorithms. The scheduling problem is phrased as a control problem, and control-theoretical techniques are used to de...
Carlo A. Furia, Alberto Leva, Martina Maggio, Paol...