Sciweavers

3136 search results - page 99 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
MP
2002
85views more  MP 2002»
15 years 6 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
RECOMB
2004
Springer
16 years 6 months ago
Chromosomal breakpoint re-use in the inference of genome sequence rearrangement
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
David Sankoff, Phil Trinh
FCT
2009
Springer
15 years 11 months ago
Multiway In-Place Merging
Abstract. We present an algorithm for asymptotically efficient multiway blockwise in-place merging. Given an array A containing sorted subsequences A1, . . . , Ak of respective le...
Viliam Geffert, Jozef Gajdos
CEC
2007
IEEE
16 years 19 days ago
A study on application of fitness inference method to PC-IGA
— This paper applies the fitness inference method to Interactive Genetic Algorithm based on Paired Comparison (PC-IGA). PC-IGA enables users to reduce the mental burden for eval...
Yoshinobu Watanabe, Tomohiro Yoshikawa, Takeshi Fu...
RTCSA
2000
IEEE
15 years 10 months ago
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition
Traditional multiprocessor real-time scheduling partitions a task set and applies uniprocessor scheduling on each processor. By allowing a task to resume on another processor than...
Björn Andersson, Jan Jonsson