Sciweavers

5580 search results - page 100 / 1116
» Randomized priority algorithms
Sort
View
CP
2004
Springer
15 years 3 months ago
Decomposition and Learning for a Hard Real Time Task Allocation Problem
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...
Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Ma...
EMSOFT
2004
Springer
15 years 3 months ago
Multiple process execution in cache related preemption delay analysis
Cache prediction for preemptive scheduling is an open issue despite its practical importance. First analysis approaches use simplified models for cache behavior or they assume si...
Jan Staschulat, Rolf Ernst
ICALP
2010
Springer
14 years 11 months ago
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
Allan Borodin, Brendan Lucier
ACISP
2009
Springer
15 years 2 months ago
Random Order m-ary Exponentiation
This paper describes a m-ary exponentiation algorithm where the radix-m digits of an exponent can be treated in a somewhat random order without using any more group operations than...
Michael Tunstall
RTSS
2007
IEEE
15 years 4 months ago
Real-Time Query Scheduling for Wireless Sensor Networks
Recent years have seen the emergence of wireless sensor network systems that must support high data rate and realtime queries of physical environments. This paper proposes Real-Ti...
Octav Chipara, Chenyang Lu, Gruia-Catalin Roman