874 search results - page 160 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
EUROPAR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form o...
DAWAK
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
DATE
1999
IEEE
15 years 2 months ago
1999
IEEE
In this paper, we present a system synthesis algorithm, called MOCSYN, which partitions and schedules embedded system specifications to intellectual property cores in an integrate...