Sciweavers

2924 search results - page 81 / 585
» Lower Bounds in Distributed Computing
Sort
View
DLOG
2003
13 years 10 months ago
Complexity of Reasoning
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
Francesco M. Donini
SPAA
2006
ACM
14 years 2 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...
IPPS
2008
IEEE
14 years 3 months ago
Analytic performance models for bounded queueing systems
Praveen Krishnamurthy, Roger D. Chamberlain
IPPS
1998
IEEE
14 years 1 months ago
Optimal Bounds on Tail Probabilities - A Simplified Approach
Aviad Cohen, Yuri Rabinovich, Assaf Schuster, Hada...