3713 search results - page 183 / 743 » Constructing a Calculus of Programs |
127
Voted
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
Optimal behavior is a very desirable property of autonomous agents and, as such, has received much attention over the years. However, making optimal decisions and executing optima...
135
Voted
DAC
2010
ACM
15 years 7 months ago
2010
ACM
—Discrete gate sizing is one of the most commonly used, flexible, and powerful techniques for digital circuit optimization. The underlying problem has been proven to be NP-hard ...
226
click to vote
LISP
2006
15 years 3 months ago
2006
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present a new approach based on the igher-order abstract syntax and ...
140
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
126
Voted
COCOA
2007
Springer
15 years 9 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...