3663 search results - page 77 / 733 » Problems in the ontology of computer programs |
COR
2010
13 years 8 months ago
2010
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
CSR
2009
Springer
13 years 9 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
SGAI
2009
Springer
14 years 3 months ago
2009
Springer
The decision which hardware platform to use for a certain application is an important problem in computer architecture. This paper reports on a study where a data-mining approach i...
ALP
1997
Springer
14 years 28 days ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
APL
2000
ACM
14 years 1 months ago
2000
ACM
Although classical object-oriented programming languages provide high-level modeling capacities t data type, inheritance etc.), they remain low-level when it comes to data manipul...