Sciweavers

42230 search results - page 183 / 8446
» Algorithms and Complexity Results for
Sort
View
ICN
2005
Springer
15 years 12 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
DAC
2003
ACM
16 years 7 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li
KR
2004
Springer
15 years 12 months ago
Optimization Techniques for Retrieving Resources Described in OWL/RDF Documents: First Results
Practical description logic systems play an ever-growing role for knowledge representation and reasoning research even in distributed environments. In particular, the often-discus...
Volker Haarslev, Ralf Möller
ECRTS
2002
IEEE
15 years 11 months ago
Robustness results concerning EDF scheduling upon uniform multiprocessors
—Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s fo...
Sanjoy K. Baruah
IPL
2002
119views more  IPL 2002»
15 years 6 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski