Sciweavers

416 search results - page 67 / 84
» A Complexity Based Feature to Support Emergence in MAS
Sort
View
AAAI
2006
13 years 10 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
BMCBI
2008
108views more  BMCBI 2008»
13 years 8 months ago
A nonparametric model for quality control of database search results in shotgun proteomics
Background: Analysis of complex samples with tandem mass spectrometry (MS/MS) has become routine in proteomic research. However, validation of database search results creates a bo...
Jiyang Zhang, Jianqi Li, Xin Liu, Hongwei Xie, Yun...
ISCI
2007
130views more  ISCI 2007»
13 years 8 months ago
Learning to classify e-mail
In this paper we study supervised and semi-supervised classification of e-mails. We consider two tasks: filing e-mails into folders and spam e-mail filtering. Firstly, in a sup...
Irena Koprinska, Josiah Poon, James Clark, Jason C...
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 8 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
HPDC
2009
IEEE
14 years 3 months ago
Pluggable parallelisation
This paper presents the concept of pluggable parallelisation that allows scientists to develop “sequential like” codes that can take advantage of multi-core, cluster and grid ...
Rui C. Gonçalves, João Luís S...