4722 search results - page 235 / 945 » Representation-independent program analysis |
143
click to vote
LLC
2010
15 years 1 months ago
2010
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...
142
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
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...
183
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
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...
148
click to vote
ICSE
2007
IEEE-ACM
16 years 6 months ago
2007
IEEE-ACM
This paper presents Kato, a tool that implements a novel class of optimizations that are inspired by program slicing for imperative languages but are applicable to analyzable decl...
171
click to vote
ICC
2007
IEEE
16 years 24 days ago
2007
IEEE
— 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...