Sciweavers

8016 search results - page 352 / 1604
» On the practical genetic algorithms
Sort
View
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 10 months ago
Characterizing the dynamics of symmetry breaking in genetic programming
This paper introduces a metric that measures symmetry in tree graphs, which allows for a statistical characterization of GP solutions by their architectural "shapes." A ...
Jason M. Daida
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
16 years 4 days ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
VLDB
1999
ACM
174views Database» more  VLDB 1999»
15 years 11 months ago
Extending Practical Pre-Aggregation in On-Line Analytical Processing
On-Line Analytical Processing (OLAP) based on a dimensional view of data is being used increasingly for the purpose of analyzing very large amounts of data. To improve query perfo...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
SEMWEB
2007
Springer
16 years 26 days ago
An Ontology-based Bayesian Network Approach for Representing Uncertainty in Clinical Practice Guidelines
Clinical Practice Guidelines (CPGs) play an important role in improving the quality of care and patient outcomes. Although several machine-readable representations of practice guid...
Hai-Tao Zheng, Bo-Yeong Kang, Hong-Gee Kim
ICONIP
2008
15 years 8 months ago
Improvement of Practical Recurrent Learning Method and Application to a Pattern Classification Task
Practical Recurrent Learning (PRL) has been proposed as a simple learning algorithm for recurrent neural networks[1][2]. This algorithm enables learning with practical order O(n2 )...
Mohamad Faizal Bin Samsudin, Katsunari Shibata