450 search results - page 51 / 90 » Algorithmic uses of the Feferman-Vaught Theorem |
POPL
2000
ACM
14 years 1 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
COLT
2006
Springer
14 years 15 days ago
2006
Springer
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
ANSS
2001
IEEE
14 years 13 days ago
2001
IEEE
In this paper, we employ the finite state machine (FSM) model for networks to investigate fault identification using passive testing. First, we introduce the concept of passive te...
CADE
2005
Springer
14 years 9 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
FOCI
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— Centroid, cardinality, fuzziness, variance and skewness are all important concepts for an interval type-2 fuzzy set (IT2 FS) because they are all measures of uncertaint...