784 search results - page 89 / 157 » Relaxing the Value Restriction |
LOPSTR
2004
Springer
14 years 2 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
PPSN
2004
Springer
14 years 2 months ago
2004
Springer
Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...
DATE
2003
IEEE
14 years 2 months ago
2003
IEEE
We propose a method for local search of Boolean relations relating variables of a CNF formula. The method is to branch on small subsets of the set of CNF variables and to analyze ...
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
A number of software packages are available for the construction of comprehensive human genetic maps. In this paper we parallelize the widely used package Genehunter. We restrict ...
ICDT
2003
ACM
14 years 2 months ago
2003
ACM
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...