Sciweavers

491 search results - page 24 / 99
» A Fast KNN Algorithm Based on Simulated Annealing
Sort
View
ISDA
2008
IEEE
14 years 2 months ago
Cultural-Based Genetic Algorithm: Design and Real World Applications
Due to their excellent performance in solving combinatorial optimization problems, metaheuristics algorithms such as Genetic Algorithms (GA), Simulated Annealing (SA) and Tabu Sea...
Mostafa A. El-Hosseini, Aboul Ella Hassanien, Ajit...
VLSID
2006
IEEE
143views VLSI» more  VLSID 2006»
14 years 1 months ago
Frame Based Fair Multiprocessor Scheduler: A Fast Fair Algorithm for Real-Time Embedded Systems
This paper presents Frame Based Fair Multiprocessor Scheduler (FBFMS) which provides accurate real-time proportional fair scheduling for a set of dynamic tasks on a symmetric mult...
Arnab Sarkar, P. P. Chakrabarti, Rajeev Kumar
ASPDAC
2006
ACM
146views Hardware» more  ASPDAC 2006»
14 years 1 months ago
A fixed-die floorplanning algorithm using an analytical approach
— Fixed-die floorplanning is an important problem in the modern physical design process. An effective floorplanning algorithm is crucial to improving both the quality and the t...
Yong Zhan, Yan Feng, Sachin S. Sapatnekar
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
14 years 1 months ago
ERA: An Algorithm for Reducing the Epistasis of SAT Problems
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
AE
2009
Springer
13 years 9 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez