1359 search results - page 112 / 272 » Black-Box Program Specialization |
SFP
2001
13 years 10 months ago
2001
: It is well known that type constructors of incomplete trees (trees with variables) carry the structure of a monad with substitution as the extension operation. Less known are the...
WAE
2001
13 years 10 months ago
2001
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects...
ISMB
1997
13 years 10 months ago
1997
Seq7 is a newprogramfor generating multiple structure-based alignments of RNAsequences. Byusing a variant of Dijkstra’s algorithm to find the shortest path through a specially c...
CODAS
1996
13 years 10 months ago
1996
ntic abstractions classification, aggregation and generalization are extremely useful for modeling complex situations containing time-independent events. This paper shows that the...
JGO
2008
13 years 8 months ago
2008
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...