Sciweavers

5580 search results - page 174 / 1116
» Randomized priority algorithms
Sort
View
MOBIHOC
2006
ACM
15 years 9 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu
AMAI
2004
Springer
15 years 3 months ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos
GPEM
2007
119views more  GPEM 2007»
14 years 10 months ago
Genomic mining for complex disease traits with "random chemistry"
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
Margaret J. Eppstein, Joshua L. Payne, Bill C. Whi...
RTAS
2008
IEEE
15 years 4 months ago
Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems
A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid...
Sanjoy K. Baruah, Nathan Fisher
INFOCOM
2000
IEEE
15 years 2 months ago
Differentiated Admission Control in Large Networks
Abstract—This paper proposes a simple but effective admission control algorithm for integrated services packet networks. The admission control scheme, based on stochastic control...
Cedric Adjih, Philippe Jacquet, Philippe Robert