Sciweavers

6546 search results - page 98 / 1310
» Improving the Performance of the RISE Algorithm
Sort
View
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
16 years 5 days ago
Improving particle swarm optimization with differentially perturbed velocity
This paper introduces a novel scheme of improving the performance of particle swarm optimization (PSO) by a vector differential operator borrowed from differential evolution (DE)....
Swagatam Das, Amit Konar, Uday Kumar Chakraborty
ICCAD
2002
IEEE
149views Hardware» more  ICCAD 2002»
16 years 3 months ago
Gate sizing using Lagrangian relaxation combined with a fast gradient-based pre-processing step
─ In this paper, we present Forge, an optimal algorithm for gate sizing using the Elmore delay model. The algorithm utilizes Lagrangian relaxation with a fast gradient-based pre-...
Hiran Tennakoon, Carl Sechen
P2P
2002
IEEE
103views Communications» more  P2P 2002»
15 years 11 months ago
Request Algorithms in Freenet-Style Peer-to-Peer Systems
In most peer-to-peer systems, edge resources self-organize into overlay networks. At the core of Freenet-style peer-to-peer systems are insert and request algorithms that dynamica...
Jens Mache, Melanie Gilbert, Jason Guchereau, Jeff...
SPIN
2005
Springer
16 years 4 days ago
Improving Spin's Partial-Order Reduction for Breadth-First Search
We describe an improvement of the partial-order reduction algorithm for breadth-first search which was introduced in Spin version 4.0. Our improvement is based on the algorithm by...
Dragan Bosnacki, Gerard J. Holzmann
AIPS
2006
15 years 8 months ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith