Sciweavers

Share
CONCUR
2006
Springer
9 years 11 days ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
IFL
2003
Springer
159views Formal Methods» more  IFL 2003»
9 years 3 months ago
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
Pedro B. Vasconcelos, Kevin Hammond
IPSN
2004
Springer
9 years 3 months ago
Loss inference in wireless sensor networks based on data aggregation
In this paper, we consider the problem of inferring per node loss rates from passive end-to-end measurements in wireless sensor networks. Speci´Čücally, we consider the case of in...
Gregory Hartl, Baochun Li
books