2343 search results - page 317 / 469 » Structure and Interpretation of Computer Programs |
146
click to vote
MP
2008
15 years 5 months ago
2008
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
174
click to vote
EM
2010
15 years 5 months ago
2010
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
159
click to vote
PPOPP
2012
ACM
14 years 20 days ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
127
click to vote
SAC
2006
ACM
15 years 11 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
131
click to vote
SPIN
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We report on the use of model checking techniques for both the verification of a process control program and the derivation of optimal control schedules. Most of this wor...