Sciweavers

7123 search results - page 1337 / 1425
» The Ordered Set of Rough Sets
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
14 years 26 days ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
14 years 26 days ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
CTCS
1989
Springer
14 years 26 days ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
FPCA
1989
14 years 26 days ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
AGTIVE
2007
Springer
14 years 25 days ago
Transforming Timeline Specifications into Automata for Runtime Monitoring
Abstract. In runtime monitoring, a programmer specifies code to execute whenever a sequence of events occurs during program execution. Previous and related work has shown that runt...
Eric Bodden, Hans Vangheluwe
« Prev « First page 1337 / 1425 Last » Next »