Sciweavers

9325 search results - page 185 / 1865
» The decentralized implementability problem
Sort
View
ICSE
2003
IEEE-ACM
16 years 3 months ago
Using Problem Frames with Distributed Architectures: A Case for Cardinality on Interfaces
Certain classes of problems amenable to description using Problem Frames, in particular ones intended to be implemented using a distributed architecture, can benefit by the additi...
Charles B. Haley
IPPS
2007
IEEE
15 years 9 months ago
Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem
— This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings...
Radoslav Andreev, Patrick Healy, Nikola S. Nikolov
ADMA
2005
Springer
189views Data Mining» more  ADMA 2005»
15 years 8 months ago
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...
Xuan Liu, Hongmei He, Ondrej Sýkora
CP
2005
Springer
15 years 8 months ago
Solving the Car-Sequencing Problem as a Non-binary CSP
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
Mihaela Butaru, Zineb Habbas
CCCG
2007
15 years 4 months ago
The Slider-Pinning Problem
A Laman mechanism is a flexible planar bar-and-joint framework with m ≤ 2n−3 edges and exactly k = 2n− m degrees of freedom. The slider-pinning problem is to eliminate all ...
Audrey Lee, Ileana Streinu, Louis Theran