1086 search results - page 21 / 218 » Programming by Numbers: A Programming Method for Novices |
108
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
105
Voted
SAS
1991
Springer
15 years 5 months ago
1991
Springer
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
129
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
95
Voted
ICRA
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— We describe how a graph grammar program for robotic self-assembly, together with measurements of kinetic rate data yield a Markov Process model of the dynamics of progr...
113
click to vote
CAV
2010
Springer
15 years 5 months ago
2010
Springer
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...