Sciweavers

1808 search results - page 260 / 362
» Locality optimization in wireless applications
Sort
View
DDECS
2008
IEEE
137views Hardware» more  DDECS 2008»
15 years 11 months ago
Cluster-based Simulated Annealing for Mapping Cores onto 2D Mesh Networks on Chip
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
Zhonghai Lu, Lei Xia, Axel Jantsch
IJCNN
2007
IEEE
15 years 10 months ago
Evaluation of Performance Measures for SVR Hyperparameter Selection
— To obtain accurate modeling results, it is of primal importance to find optimal values for the hyperparameters in the Support Vector Regression (SVR) model. In general, we sea...
Koen Smets, Brigitte Verdonk, Elsa Jordaan
LION
2007
Springer
138views Optimization» more  LION 2007»
15 years 10 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
EVOW
2009
Springer
15 years 9 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 8 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson