1520 search results - page 49 / 304 » Class Hierarchy Specialization |
OOPSLA
1989
Springer
13 years 11 months ago
1989
Springer
The notions of class, subclass and virtual procedure are fairly well understood and recognized as some of the key concepts in object-oriented programming. The possibility of modif...
IWOCA
2010
Springer
13 years 2 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
MLQ
2000
13 years 7 months ago
2000
It is well known that the model categories of universal Horn theories are locally presentable, hence essentially algebraic [2]. In the special case of quasivarieties a direct tran...
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
ECSQARU
2001
Springer
14 years 6 days ago
2001
Springer
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...