Sciweavers

1359 search results - page 52 / 272
» Black-Box Program Specialization
Sort
View
IOR
2010
98views more  IOR 2010»
13 years 6 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 3 months ago
Lower bound for deterministic semantic-incremental branching programs solving GEN
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
Dustin Wehr
TLCA
2007
Springer
14 years 2 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva
ICCBR
2003
Springer
14 years 1 months ago
Using Evolution Programs to Learn Local Similarity Measures
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...
Armin Stahl, Thomas Gabel
OOPSLA
1989
Springer
14 years 22 days ago
Virtual Classes: A Powerful Mechanism in Object-Oriented Programming
The notions of class, subclass and virtual procedure are fairly well understood and recognized as some of the key concepts in object-oriented programming. The possibility of modif...
Ole Lehrmann Madsen, Birger Møller-Pedersen