98 search results - page 3 / 20 » Constraints as polymorphic connectors |
FLOPS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
107
click to vote
ENTCS
2007
14 years 10 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
101
click to vote
EJC
2008
14 years 10 months ago
2008
We study certain constraint satisfaction problems which are the problems of deciding whether there exists a homomorphism from a given relational structure to a fixed structure with...
89
Voted
DAGSTUHL
2006
14 years 11 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
FSEN
2009
Springer
15 years 3 months ago
2009
Springer
Although presented with a variety of ‘flavours’, the notion of an interactor, as an abstract characterisation of an interactive component, is well-known in the area of formal ...