Sciweavers

2905 search results - page 250 / 581
» Formal Memetic Algorithms
Sort
View
COCOON
2005
Springer
15 years 4 months ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...
FM
2005
Springer
112views Formal Methods» more  FM 2005»
15 years 4 months ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...
55
Voted
MKM
2005
Springer
15 years 4 months ago
Processing Textbook-Style Matrices
In mathematical textbooks matrices are often represented as objects of indefinite size containing abbreviations. To make the knowledge implicitly given in these representations av...
Alan P. Sexton, Volker Sorge
PAKDD
2005
ACM
96views Data Mining» more  PAKDD 2005»
15 years 4 months ago
Kernels over Relational Algebra Structures
Abstract. In this paper we present a novel and general framework based on concepts of relational algebra for kernel-based learning over relational schema. We exploit the notion of ...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
FORMATS
2004
Springer
15 years 4 months ago
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...