Sciweavers

1061 search results - page 38 / 213
» Natural Selection in Relation to Complexity
Sort
View
CDC
2008
IEEE
114views Control Systems» more  CDC 2008»
13 years 11 months ago
Dynamic test selection for reconfigurable diagnosis
Abstract-- Detecting and isolating multiple faults is a computationally intense task which typically consists of computing a set of tests, and then computing the diagnoses based on...
Mattias Krysander, Fredrik Heintz, Jacob Roll, Eri...
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 3 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
ENGL
2007
109views more  ENGL 2007»
13 years 9 months ago
Using Neural Network for DJIA Stock Selection
—This paper presents methodologies to select equities based on soft-computing models which focus on applying fundamental analysis for equities screening. This paper compares the ...
Tong-Seng Quah
DSN
2007
IEEE
14 years 3 months ago
On the Selection of Error Model(s) for OS Robustness Evaluation
The choice of error model used for robustness evaluation of Operating Systems (OSs) influences the evaluation run time, implementation complexity, as well as the evaluation preci...
Andréas Johansson, Neeraj Suri, Brendan Mur...
CIDR
2003
134views Algorithms» more  CIDR 2003»
13 years 10 months ago
Approximate Range Selection Queries in Peer-to-Peer Systems
We present an architecture for a data sharing peer-to-peer system where the data is shared in the form of database relations. In general, peer-to-peer systems try to locate exactm...
Abhishek Gupta, Divyakant Agrawal, Amr El Abbadi