3663 search results - page 114 / 733 » Problems in the ontology of computer programs |
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
120
click to vote
VECPAR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
ISHPC
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
IFIP
1993
Springer
15 years 2 months ago
1993
Springer
In this paper we examine the current computer science curriculum in elementary schools and identify its shortcomings. We then presents a new approach to teaching computer science ...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...