Sciweavers

4940 search results - page 185 / 988
» On the Complexity of Universal Programs
Sort
View
VLSID
2008
IEEE
191views VLSI» more  VLSID 2008»
16 years 15 days ago
Programming and Performance Modelling of Automotive ECU Networks
The last decade has seen a phenomenal increase in the use of electronic components in automotive systems, resulting in the replacement of purely mechanical or hydraulic-implementa...
Samarjit Chakraborty, Sethu Ramesh
172
Voted
COMPGEOM
1992
ACM
15 years 10 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl
CHI
2002
ACM
16 years 6 months ago
Tangible programming elements for young children
Tangible programming elements offer the dynamic and programmable properties of a computer without the complexity introduced by the keyboard, mouse and screen. This paper explores ...
Peta Wyeth, Helen C. Purchase
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 10 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
FORTE
2007
15 years 7 months ago
Composition of Model Programs
Model programs are a useful formalism for software testing and design analysis. They are used in industrial tools, such as SpecExplorer, as a compact, expressive and precise way to...
Margus Veanes, Colin Campbell, Wolfram Schulte