1357 search results - page 184 / 272 » Compositionality in Graph Transformation |
173
click to vote
ECOOPWEXCEPTION
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper describes a scheme of manipulating (partial) continuations in imperative languages such as Java and C++ in a portable manner, where the portability means that ...
207
click to vote
COCO
1997
Springer
15 years 10 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
176
click to vote
ECOOP
2007
Springer
15 years 10 months ago
2007
Springer
In this chapter, we explore the emerging research domain of modeldriven software refactoring. Program refactoring is a proven technique that aims at improving the quality of sourc...
172
click to vote
GREC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper, we propose a new approach for symbol recognition using structural signatures and a Galois Lattice as classifier. The structural signatures are based on top...
141
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We present a method for transforming the infinite interactive state space of interactive POMDPs (I-POMDPs) into a finite one, thereby enabling the computation of exact solutions. ...