Sciweavers

1005 search results - page 199 / 201
» Practical Secure Function Evaluation
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 5 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 5 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 5 months ago
Network Protection Codes: Providing Self-healing in Autonomic Networks Using Network Coding
Agile recovery from link failures in autonomic communication networks is essential to increase robustness, accessibility, and reliability of data transmission. However, this must b...
Salah A. Aly, Ahmed E. Kamal
BMCBI
2006
154views more  BMCBI 2006»
13 years 5 months ago
An improved procedure for gene selection from microarray experiments using false discovery rate criterion
Background: A large number of genes usually show differential expressions in a microarray experiment with two types of tissues, and the p-values of a proper statistical test are o...
James J. Yang, Mark C. K. Yang
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 5 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...