Sciweavers

10792 search results - page 324 / 2159
» An Evaluation of Non-Equijoin Algorithms
Sort
View
ICCAD
1994
IEEE
90views Hardware» more  ICCAD 1994»
15 years 11 months ago
Algorithm selection: a quantitative computation-intensive optimization approach
Given a set of specifications for a targeted application, algorithm selection refers to choosing the most suitable algorithm for a given goal, among several functionally equivalen...
Miodrag Potkonjak, Jan M. Rabaey
GECCO
2004
Springer
103views Optimization» more  GECCO 2004»
16 years 5 days ago
Training Neural Networks with GA Hybrid Algorithms
Abstract. Training neural networks is a complex task of great importance in the supervised learning field of research. In this work we tackle this problem with five algorithms, a...
Enrique Alba, J. Francisco Chicano
ICSE
2003
IEEE-ACM
16 years 6 months ago
Precise Dynamic Slicing Algorithms
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
CEC
2007
IEEE
16 years 1 months ago
Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms
— Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The ba...
Lucas Bradstreet, R. Lyndon While, Luigi Barone
ADMA
2006
Springer
121views Data Mining» more  ADMA 2006»
16 years 24 days ago
A New Polynomial Time Algorithm for Bayesian Network Structure Learning
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
Sanghack Lee, Jihoon Yang, Sungyong Park