Sciweavers

99 search results - page 2 / 20
» On a subclass of close-to-convex functions
Sort
View
ALT
2002
Springer
14 years 6 months ago
Classes with Easily Learnable Subclasses
In this paper we study the question of whether identifiable classes have subclasses which are identifiable under a more restrictive criterion. The chosen framework is inductive ...
Sanjay Jain, Wolfram Menzel, Frank Stephan
ECOOP
2006
Springer
14 years 1 months ago
Parameterized Modules for Classes and Extensible Functions
Abstract. We present F(Eml), a language that combines classes, extensible functions, symmetric multiple dispatching, and a practical system for parameterized modules. Parameterized...
Keunwoo Lee, Craig Chambers
EUSFLAT
2007
100views Fuzzy Logic» more  EUSFLAT 2007»
13 years 11 months ago
Left-continuous t-norms as Functional Algebras
With a left-continuous t-norm , we may associate the set of its vertical cuts, namely, the set F of functions fa : [0, 1] → [0, 1], x → x a. Endowed with the pointwise order, ...
Thomas Vetterlein
DAM
2008
139views more  DAM 2008»
13 years 10 months ago
Covering symmetric semi-monotone functions
We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-mo...
Roland Grappe, Zoltán Szigeti
ACTA
2010
104views more  ACTA 2010»
13 years 10 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...