Sciweavers

7796 search results - page 147 / 1560
» On Generalized Schur Numbers
Sort
View
ASPLOS
2012
ACM
14 years 2 months ago
A case for unlimited watchpoints
Numerous tools have been proposed to help developers fix software errors and inefficiencies. Widely-used techniques such as memory checking suffer from overheads that limit thei...
Joseph L. Greathouse, Hongyi Xin, Yixin Luo, Todd ...
CORR
2012
Springer
193views Education» more  CORR 2012»
14 years 2 months ago
A Unifying Framework for Linearly Solvable Control
Recent work has led to the development of an elegant theory of Linearly Solvable Markov Decision Processes (LMDPs) and related Path-Integral Control Problems. Traditionally, LMDPs...
Krishnamurthy Dvijotham, Emanuel Todorov
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 9 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 6 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
TMC
2010
109views more  TMC 2010»
15 years 4 months ago
On the Performance Bounds of Practical Wireless Network Coding
—Network coding is an attracting technology that has been shown to be able to improve the throughput of wireless networks. However, there still lacks fundamental understanding on...
Jilin Le, John C. S. Lui, Dah-Ming Chiu