Sciweavers

2446 search results - page 407 / 490
» Polyadic Concept Analysis
Sort
View
APSEC
2007
IEEE
14 years 1 months ago
Definition of an Executable SPEM 2.0
One major advantage of executable models is that once constructed, they can be run, checked, validated and improved in short incremental and iterative cycles. In the field of Soft...
Reda Bendraou, Benoît Combemale, Xavier Cr&e...
CEC
2007
IEEE
14 years 1 months ago
Development and validation of different hybridization strategies between GA and PSO
In this paper a new class of hybridization strategies between GA and PSO is presented and validated. The Genetical Swarm Optimization (GSO) approach is presented here with respect ...
A. Gandelli, F. Grimaccia, Marco Mussetta, Paola P...
CIKM
2009
Springer
14 years 1 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
ISSTA
2010
ACM
14 years 1 months ago
Learning from 6, 000 projects: lightweight cross-project anomaly detection
Real production code contains lots of knowledge—on the domain, on the architecture, and on the environment. How can we leverage this knowledge in new projects? Using a novel lig...
Natalie Gruska, Andrzej Wasylkowski, Andreas Zelle...
PODC
2010
ACM
14 years 1 months ago
Brief announcement: anonymity and trust in distributed systems
In this paper, we present a framework for achieving anonymity and trust, two seemingly contradictory properties, in distributed systems. Our approach builds on webs of trust, a we...
Michael Backes, Stefan Lorenz, Matteo Maffei, Kim ...