Sciweavers

4110 search results - page 141 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
AE
2009
Springer
15 years 5 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
EVOW
2006
Springer
15 years 8 months ago
Associative Memory Scheme for Genetic Algorithms in Dynamic Environments
In recent years dynamic optimization problems have attracted a growing interest from the community of genetic algorithms with several approaches developed to address these problems...
Shengxiang Yang
ATAL
2010
Springer
15 years 5 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
COMBINATORICS
2004
99views more  COMBINATORICS 2004»
15 years 4 months ago
A Fast Algorithm for MacMahon's Partition Analysis
This paper deals with evaluating constant terms of a special class of rational functions, the Elliott-rational functions. The constant term of such a function can be read off immed...
Guoce Xin
DAC
1996
ACM
15 years 8 months ago
A Hardware/Software Partitioning Algorithm for Designing Pipelined ASIPs with Least Gate Counts
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...
Nguyen-Ngoc Bình, Masaharu Imai, Akichika S...