Sciweavers

908 search results - page 78 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
ATAL
2007
Springer
16 years 11 days ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
MICAI
2007
Springer
16 years 9 days ago
Hybrid Evolutionary Algorithm for Flowtime Minimisation in No-Wait Flowshop Scheduling
This research presents a novel approach to solve m-machine no-wait flowshop scheduling problem. A continuous flowshop problem with total flowtime as criterion is considered appl...
Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz ...
MSWIM
2005
ACM
15 years 11 months ago
The optimal choice of encoding parameters for MPEG-4 AAC streamed over wireless networks
This paper addresses a novel linear programming based approach to optimize the choice of the encoding parameters for the MPEG-4 AAC audio codec. Current techniques solve the encod...
Claus Bauer
TCBB
2008
107views more  TCBB 2008»
15 years 6 months ago
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
DAC
2002
ACM
16 years 7 months ago
Schedulability of event-driven code blocks in real-time embedded systems
Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Tasks in many such systems, like netwo...
Samarjit Chakraborty, Thomas Erlebach, Simon K&uum...