Sciweavers

301 search results - page 34 / 61
» On extensions of a theorem of Baxter
Sort
View
ECOOP
1998
Springer
15 years 2 months ago
A Study of The Fragile Base Class Problem
In this paper we study the fragile base class problem. This problem occurs in open object-oriented systems employing code inheritance as an implementation reuse mechanism. System d...
Leonid Mikhajlov, Emil Sekerinski
JANCL
2008
170views more  JANCL 2008»
14 years 9 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
JSYML
2008
72views more  JSYML 2008»
14 years 9 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson
ICML
2005
IEEE
15 years 10 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
WOSP
2010
ACM
15 years 4 months ago
A general result for deriving product-form solutions in markovian models
In this paper we provide a general method to derive productform solutions for stochastic models. We take inspiration from the Reversed Compound Agent Theorem [14] and we provide a...
Andrea Marin, Maria Grazia Vigliotti