Sciweavers

6437 search results - page 1209 / 1288
» Parallel Algorithms for Arrangements
Sort
View
125
Voted
WOB
2004
120views Bioinformatics» more  WOB 2004»
15 years 2 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...
98
Voted
WSC
2004
15 years 2 months ago
A Framework for Adaptive Synchronization of Distributed Simulations
Increased complexity of simulation models and the related modeling needs for global supply chains have necessitated the execution of simulations on multiple processors. While dist...
Bertan Altuntas, Richard A. Wysk
111
Voted
AAAI
1998
15 years 2 months ago
Multi Machine Scheduling: An Agent-Based Approach
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
Rama Akkiraju, Pinar Keskinocak, Sesh Murthy, Fred...
AIPS
2000
15 years 2 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
IPCO
1998
99views Optimization» more  IPCO 1998»
15 years 1 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
« Prev « First page 1209 / 1288 Last » Next »