2252 search results - page 306 / 451 » Lower Bounds for Dynamic Algorithms |
137
Voted
KI
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
130
Voted
COMCOM
2004
15 years 3 months ago
2004
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
145
click to vote
ICPADS
2005
IEEE
15 years 9 months ago
2005
IEEE
Low energy consumptions are extremely important in real-time embedded systems, and scheduling is one of the techniques used to obtain lower energy consumptions. In this paper, we ...
115
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We analyze the mixing time of a natural local Markov chain (the Glauber dynamics) on configurations of the solid-onsolid model of statistical physics. This model has been proposed...
166
Voted
ICCAD
2001
IEEE
16 years 10 days ago
2001
IEEE
- Real-time scheduling on processors that support dynamic voltage and frequency scaling is analyzed. The Slacked Earliest Deadling First (SEDF) algorithm is proposed and it is show...