Sciweavers

850 search results - page 67 / 170
» heuristics 2006
Sort
View
106
Voted
EUROSYS
2006
ACM
15 years 9 months ago
On the road to recovery: restoring data after disasters
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
Kimberly Keeton, Dirk Beyer 0002, Ernesto Brau, Ar...
88
Voted
BMCBI
2006
100views more  BMCBI 2006»
15 years 23 days ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
87
Voted
IEICET
2006
55views more  IEICET 2006»
15 years 21 days ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
LOGCOM
2010
124views more  LOGCOM 2010»
14 years 11 months ago
Analytic Methods for the Logic of Proofs
The logic of proofs (LP) was proposed as Gödel’s missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for LPhave not explored this cl...
Marcelo Finger
99
Voted
ESWA
2010
175views more  ESWA 2010»
14 years 11 months ago
A multi-objective PSO for job-shop scheduling problems
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most prod...
D. Y. Sha, Hsing-Hung Lin