102 search results - page 13 / 21 » Improved Bounds for Geometric Permutations |
133
click to vote
FM
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
101
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
110
click to vote
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
121
click to vote
CORR
2010
Springer
15 years 7 hour ago
2010
Springer
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
139
click to vote
ICDCS
2000
IEEE
15 years 5 months ago
2000
IEEE
For transmission of continuous media (CM) streams such as audio and video over the Internet, a critical issue is that periodic network overloads cause bursty packet losses. Studie...