Sciweavers

14158 search results - page 254 / 2832
» Generalized switch-setting problems
Sort
View
122
Voted
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
15 years 7 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
AIPS
2008
15 years 6 months ago
CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem
In this paper, we report on a new solver for large instances of the Disjunctive Temporal Problem (DTP). Our solver is based primarily on the idea of employing "compact" ...
Blaine Nelson, T. K. Satish Kumar
WSC
2008
15 years 6 months ago
Solving volume and capacity planning problems in semiconductor manufaturing: A computational study
In this paper, we suggest a linear programming formulation that allows for solving volume and capacity planning problems in semiconductor manufacturing systems. We assume a genera...
Christoph Habla, Lars Mönch
ECAI
2008
Springer
15 years 5 months ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
15 years 5 months ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law