Sciweavers

14518 search results - page 197 / 2904
» Two Problems for Sophistication
Sort
View
ICTCS
2001
Springer
14 years 3 months ago
Job Shop Scheduling Problems with Controllable Processing Times
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...
GECCO
1999
Springer
115views Optimization» more  GECCO 1999»
14 years 3 months ago
A Diversity Study in Genetic Algorithms for Job Shop Scheduling Problems
This paper deals with the study of population diversity in Genetic Algorithms for Job Shop Scheduling Problems. A definition of population diversity at the phenotype level and a ...
Carlos A. Brizuela, Nobuo Sannomiya
ICCAD
1998
IEEE
196views Hardware» more  ICCAD 1998»
14 years 3 months ago
Analysis of watermarking techniques for graph coloring problem
We lay out a theoretical framework to evaluate watermarking techniques for intellectual property protection (IPP). Based on this framework, we analyze two watermarking techniques ...
Gang Qu, Miodrag Potkonjak
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
14 years 2 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
NAA
2000
Springer
88views Mathematics» more  NAA 2000»
14 years 2 months ago
Schwarz Methods for Convection-Diffusion Problems
Abstract. Various variants of Schwarz methods for a singularly perturbed two dimensional stationary convection-diffusion problem are constructed and analysed. The iteration counts,...
H. MacMullen, Eugene O'Riordan, Grigorii I. Shishk...