Sciweavers

446 search results - page 36 / 90
» Using a genetic algorithm approach to solve the dynamic chan...
Sort
View
FLAIRS
2004
13 years 10 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
HPDC
2005
IEEE
14 years 2 months ago
Genetic algorithm based automatic data partitioning scheme for HPF
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
Sunil Kumar Anand, Y. N. Srikant
GECCO
2003
Springer
120views Optimization» more  GECCO 2003»
14 years 1 months ago
Multi-FPGA Systems Synthesis by Means of Evolutionary Computation
Abstract. Multi-FPGA systems (MFS) are used for a great variety of applications, for instance, dynamically re-configurable hardware applications, digital circuit emulation, and num...
José Ignacio Hidalgo, Francisco Ferná...
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 9 months ago
Application domain study of evolutionary algorithms in optimization problems
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
Pilar Caamaño, Francisco Bellas, José...
ICCAD
1997
IEEE
95views Hardware» more  ICCAD 1997»
14 years 27 days ago
An exact solution to simultaneous technology mapping and linear placement problem
In this paper, we present an optimal algorithm for solving the simultaneous technology mapping and linear placement problem for tree-structured circuits with the objective of mini...
Jinan Lou, Amir H. Salek, Massoud Pedram