2252 search results - page 104 / 451 » Lower Bounds for Dynamic Algorithms |
139
click to vote
SOFTWARE
2002
15 years 2 months ago
2002
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
111
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...
127
click to vote
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
110
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
121
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...