Sciweavers

903 search results - page 161 / 181
» Non-well-founded trees in categories
Sort
View
CSB
2002
IEEE
109views Bioinformatics» more  CSB 2002»
15 years 6 months ago
Towards Automatic Clustering of Protein Sequences
Analyzing protein sequence data becomes increasingly important recently. Most previous work on this area has mainly focused on building classification models. In this paper, we i...
Jiong Yang, Wei Wang 0010
SIGMOD
2010
ACM
184views Database» more  SIGMOD 2010»
15 years 6 months ago
Load-balanced query dissemination in privacy-aware online communities
We propose a novel privacy-preserving distributed infrastructure in which data resides only with the publishers owning it. The infrastructure disseminates user queries to publishe...
Emiran Curtmola, Alin Deutsch, K. K. Ramakrishnan,...
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
15 years 6 months ago
Optimizing schema-last tuple-store queries in graphd
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
Scott M. Meyer, Jutta Degener, John Giannandrea, B...
GECCO
2010
Springer
129views Optimization» more  GECCO 2010»
15 years 6 months ago
A probabilistic functional crossover operator for genetic programming
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
Josh C. Bongard
ATAL
2009
Springer
15 years 6 months ago
GDT4MAS: an extension of the GDT model to specify and to verify MultiAgent systems
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
Bruno Mermet, Gaële Simon