Sciweavers

7648 search results - page 589 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
IJAR
2008
167views more  IJAR 2008»
15 years 6 months ago
Approximate algorithms for credal networks with binary variables
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman
IJCNN
2000
IEEE
15 years 11 months ago
Fuzzy Clustering Algorithm Extracting Principal Components Independent of Subsidiary Variables
Fuzzy c-varieties (FCV) is one of the clustering algorithms in which the prototypes are multi-dimensional linear varieties. The linear varieties are represented by some local prin...
Chi-Hyon Oh, Hirokazu Komatsu, Katsuhiro Honda, Hi...
GECCO
2008
Springer
132views Optimization» more  GECCO 2008»
15 years 8 months ago
Subheuristic search and scalability in a hyperheuristic
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...
Robert E. Keller, Riccardo Poli
EOR
2010
116views more  EOR 2010»
15 years 6 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
CCS
2008
ACM
15 years 8 months ago
Efficient security primitives derived from a secure aggregation algorithm
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
Haowen Chan, Adrian Perrig