811 search results - page 33 / 163 » Refactoring Using Type Constraints |
PPCP
1993
14 years 21 days ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
IJCAI
2007
13 years 10 months ago
2007
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Image registration is the process of geometrically aligning two or more images. In this paper we describe a method for registering pairs of images based on thin-plate spline mappi...
CORR
2011
Springer
13 years 12 days ago
2011
Springer
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
CP
2007
Springer
14 years 2 months ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...