Sciweavers

613 search results - page 68 / 123
» Finding and Fixing Faults
Sort
View
JCC
2006
57views more  JCC 2006»
14 years 11 months ago
A search algorithm for fixed-composition protein design
: We present a computational protein design algorithm for finding low-energy sequences of fixed amino acid composition. The search algorithms used in protein design typically do no...
Geoffrey K. Hom, Stephen L. Mayo
IJCSA
2007
110views more  IJCSA 2007»
14 years 11 months ago
Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
S. N. Sivanandam, P. Visalakshi, A. Bhuvaneswari
COMBINATORICS
2000
103views more  COMBINATORICS 2000»
14 years 11 months ago
The Action of the Symmetric Group on a Generalized Partition Semilattice
Given an integer n 2, and a non-negative integer k, consider all affine hyperplanes in Rn of the form xi = xj +r for i, j [n] and a non-negative integer r k. Let n,k be the pos...
Robert Gill
HEURISTICS
2002
108views more  HEURISTICS 2002»
14 years 11 months ago
Cooperative Parallel Tabu Search for Capacitated Network Design
We present a cooperative parallel tabu search method for the fixed charge, capacitated, multicommodity network design problem. Several communication strategies are analyzed and co...
Teodor Gabriel Crainic, Michel Gendreau
DAM
1998
77views more  DAM 1998»
14 years 11 months ago
Optimal Wavelength-routed Multicasting
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...
Bruno Beauquier, Pavol Hell, Stephane Perennes