Sciweavers

1957 search results - page 141 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
14 years 11 months ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder
JMLR
2006
117views more  JMLR 2006»
14 years 10 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
FUIN
2010
143views more  FUIN 2010»
14 years 7 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
FPL
2010
Springer
104views Hardware» more  FPL 2010»
14 years 8 months ago
Multiplicative Square Root Algorithms for FPGAs
Abstract--Most current square root implementations for FPGAs use a digit recurrence algorithm which is well suited to their LUT structure. However, recent computing-oriented FPGAs ...
Florent de Dinechin, Mioara Joldes, Bogdan Pasca, ...
CIKM
2007
Springer
15 years 4 months ago
Detecting distance-based outliers in streams of data
In this work a method for detecting distance-based outliers in data streams is presented. We deal with the sliding window model, where outlier queries are performed in order to de...
Fabrizio Angiulli, Fabio Fassetti