Sciweavers

12272 search results - page 384 / 2455
» Experimental program analysis
Sort
View
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
15 years 8 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
150
Voted
LLC
2010
15 years 1 months ago
Quantified Conditionals and Compositionality
The interpretation of conditionals in the scope of a quantifier (as in `No student will succeed if he goofs off') presents a troubling puzzle. Either we are forced to abandon...
Janneke Huitink
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
16 years 7 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 7 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
ICC
2007
IEEE
122views Communications» more  ICC 2007»
16 years 1 months ago
Dynamic Programming for Scheduling a Single Route in Wireless Networks
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
Gyouhwan Kim, Rohit Negi