Sciweavers

783 search results - page 125 / 157
» Improved approximation algorithms for the freeze-tag problem
Sort
View
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
14 years 9 days ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
CORR
2011
Springer
142views Education» more  CORR 2011»
13 years 12 days ago
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
Stefan Edelkamp
ICALP
2004
Springer
14 years 2 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
AIPS
2009
13 years 9 months ago
Incremental Policy Generation for Finite-Horizon DEC-POMDPs
Solving multiagent planning problems modeled as DECPOMDPs is an important challenge. These models are often solved by using dynamic programming, but the high resource usage of cur...
Christopher Amato, Jilles Steeve Dibangoye, Shlomo...
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
14 years 1 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang