Sciweavers

2905 search results - page 378 / 581
» Formal Memetic Algorithms
Sort
View
DAC
2003
ACM
16 years 5 months ago
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Br...
SIGSOFT
2005
ACM
16 years 4 months ago
Performance data collection using a hybrid approach
Performance profiling consists of monitoring a software system during execution and then analyzing the obtained data. There are two ways to collect profiling data: event tracing t...
Edu Metz, Raimondas Lencevicius, Teofilo F. Gonzal...
WWW
2009
ACM
16 years 4 months ago
Discovering the staring people from social networks
In this paper, we study a novel problem of staring people discovery from social networks, which is concerned with finding people who are not only authoritative but also sociable i...
Dewei Chen, Jie Tang, Juanzi Li, Lizhu Zhou
WWW
2008
ACM
16 years 4 months ago
Scalable querying services over fuzzy ontologies
Fuzzy ontologies are envisioned to be useful in the Semantic Web. Existing fuzzy ontology reasoners are not scalable enough to handle the scale of data that the Web provides. In t...
Jeff Z. Pan, Giorgos B. Stamou, Giorgos Stoilos, S...
WWW
2007
ACM
16 years 4 months ago
Just the right amount: extracting modules from ontologies
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...