Sciweavers

2721 search results - page 126 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
KES
1999
Springer
15 years 2 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli
JSC
2010
155views more  JSC 2010»
14 years 8 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
ICCAD
1997
IEEE
122views Hardware» more  ICCAD 1997»
15 years 2 months ago
Approximate timing analysis of combinational circuits under the XBD0 model
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
Yuji Kukimoto, Wilsin Gosti, Alexander Saldanha, R...
GECCO
2010
Springer
206views Optimization» more  GECCO 2010»
15 years 1 months ago
Development of efficient particle swarm optimizers by using concepts from evolutionary algorithms
Particle swarm optimization (PSO) has been in practice for more than 10 years now and has gained wide popularity in various optimization tasks. In the context to single objective ...
Kalyanmoy Deb, Nikhil Padhye
ICCAD
2002
IEEE
124views Hardware» more  ICCAD 2002»
15 years 6 months ago
Symbolic pointer analysis
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
Jianwen Zhu