Sciweavers

1095 search results - page 162 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
EWSN
2009
Springer
15 years 10 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
ISER
2000
Springer
82views Robotics» more  ISER 2000»
15 years 1 months ago
Towards a Team of Robots with Repair Capabilities: A Visual Docking System
: In the future, we propose that there will be largely self-sufficient robot colonies operating on distant planets and in harsh environments here on earth. A highly desirable quali...
Curt A. Bererton, Pradeep K. Khosla
IS
2002
14 years 9 months ago
Evaluation of concurrency control strategies for mixed soft real-time database systems
Previous research in real-time concurrency control mainly focuses on the schedulability guarantee of hard real-time transactions and the reducing of the miss rate of soft real-tim...
Kam-yiu Lam, Tei-Wei Kuo, Ben Kao, Tony S. H. Lee,...
GRID
2008
Springer
14 years 9 months ago
Statistical Analysis and Modeling of Jobs in a Grid Environment
The existence of good probabilistic models for the job arrival process and the delay components introduced at different stages of job processing in a Grid environment is important ...
Kostas Christodoulopoulos, Vasileios Gkamas, Emman...
DCC
2008
IEEE
15 years 9 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev