3663 search results - page 331 / 733 » Problems in the ontology of computer programs |
144
click to vote
ICALP
2007
Springer
16 years 28 days ago
2007
Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
167
click to vote
LICS
2006
IEEE
16 years 23 days ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
171
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. We prove that observational equivalence of IA3 + Y0 (3rdorder Idealized Algol with 0th-order recursion) is equivalent to the DPDA Equivalence Problem, and hence decidable...
219
click to vote
MFCS
2005
Springer
16 years 8 days ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
190
click to vote
JFPLC
2001
15 years 8 months ago
2001
We propose an environment for musical constraint solving, in the visual programming language OpenMusic. We describe an implementation of a local search algorithm, called adaptive s...