Sciweavers

1709 search results - page 90 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
NN
2007
Springer
15 years 4 months ago
From memory-based decisions to decision-based movements: A model of interval discrimination followed by action selection
The interval discrimination task is a classical experimental paradigm that is employed to study working memory and decision making and typically involves four phases. First, the s...
Prashant Joshi
SPDP
1993
IEEE
15 years 9 months ago
Extended Distributed Genetic Algorithm for Channel Routing
In this paper, we propose a new parallel genetic alge rithm (GA), called Extended Distributed Genetic Algorithm (EDGA), for channel routing problem. The EDGA combines the advantag...
B. B. Prahlada Rao, R. C. Hansdah
LCTRTS
2010
Springer
15 years 2 months ago
Improving both the performance benefits and speed of optimization phase sequence searches
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
Prasad A. Kulkarni, Michael R. Jantz, David B. Wha...
KDD
1998
ACM
99views Data Mining» more  KDD 1998»
15 years 9 months ago
On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
Goetz Graefe, Usama M. Fayyad, Surajit Chaudhuri
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
15 years 7 months ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie