Sciweavers

605 search results - page 81 / 121
» Parameterized Dynamic Tables
Sort
View
SPIRE
2010
Springer
14 years 9 months ago
Restricted LCS
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe...
SIGSOFT
2010
ACM
14 years 9 months ago
Future of developer testing: building quality in code
Although much progress has been made in software verification, software testing remains by far the most widely used technique for improving software reliability. Among various typ...
Tao Xie, Nikolai Tillmann, Jonathan de Halleux, Wo...
JMLR
2006
124views more  JMLR 2006»
14 years 11 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
TAP
2008
Springer
93views Hardware» more  TAP 2008»
14 years 11 months ago
Pex-White Box Test Generation for .NET
Pex automatically produces a small test suite with high code coverage for a .NET program. To this end, Pex performs a systematic program analysis (using dynamic symbolic execution,...
Nikolai Tillmann, Jonathan de Halleux
SPAA
2003
ACM
15 years 4 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder