3663 search results - page 109 / 733 » Problems in the ontology of computer programs |
FOCS
1990
IEEE
15 years 2 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
90
Voted
ADAEUROPE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
WCRE
1997
IEEE
15 years 2 months ago
1997
IEEE
There are many commercial tools that address various aspects of the Year 2000 problem. None of these tools, however, addresses the closely-related leap-year problem. In this paper...
CIE
2010
Springer
15 years 2 months ago
2010
Springer
This paper discusses Curry’s work on how to implement the problem of inverse interpolation on the ENIAC (1946) and his subsequent work on developing a theory of program compositi...
114
click to vote
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
15 years 2 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...