Sciweavers

1927 search results - page 179 / 386
» UMDAs for dynamic optimization problems
Sort
View
245
Voted
ISCA
2012
IEEE
333views Hardware» more  ISCA 2012»
13 years 6 months ago
Reducing memory reference energy with opportunistic virtual caching
Most modern cores perform a highly-associative translation look aside buffer (TLB) lookup on every memory access. These designs often hide the TLB lookup latency by overlapping it...
Arkaprava Basu, Mark D. Hill, Michael M. Swift
140
Voted
NIPS
2001
15 years 5 months ago
Learning Lateral Interactions for Feature Binding and Sensory Segmentation
We present a new approach to the supervised learning of lateral interactions for the competitive layer model (CLM) dynamic feature binding architecture. The method is based on con...
Heiko Wersing
152
Voted
WCNC
2010
IEEE
15 years 7 months ago
Network Selection in Heterogeneous Wireless Networks: Evolution with Incomplete Information
—Enabling users to connect to the best available network, dynamic network selection scheme is important for satisfying various quality of service (QoS) requirements, achieving se...
Kun Zhu, Dusit Niyato, Ping Wang
152
Voted
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
15 years 9 months ago
Towards identifying populations that increase the likelihood of success in genetic programming
This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influenc...
Jason M. Daida
171
Voted
TEC
2002
183views more  TEC 2002»
15 years 3 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy