Sciweavers

5580 search results - page 30 / 1116
» Randomized priority algorithms
Sort
View
RTAS
2010
IEEE
13 years 8 months ago
Scheduling Self-Suspending Real-Time Tasks with Rate-Monotonic Priorities
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
Karthik Lakshmanan, Ragunathan Rajkumar
CP
1995
Springer
14 years 1 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
WSC
2007
14 years 11 days ago
Spatial emergence of genotypical tribes in an animat simulation model
We observe the spontaneous emergence of spatial tribes in an animat agent model where simple genetic inheritance is supported. Our predator-prey model simulates a flat-world of a...
Kenneth A. Hawick, Chris Scogings, Heath A. James
WEA
2005
Springer
154views Algorithms» more  WEA 2005»
14 years 3 months ago
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...
CP
2000
Springer
14 years 2 months ago
Analysis of Random Noise and Random Walk Algorithms
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
Bhaskar Krishnamachari, Xi Xie, Bart Selman, Steph...