Sciweavers

11740 search results - page 127 / 2348
» More Problems in Rewriting
Sort
View
105
Voted
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
15 years 2 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz
DLT
2010
15 years 2 months ago
Inclusion Problems for Patterns with a Bounded Number of Variables
We study the inclusion problems for pattern languages that are generated by patterns with a bounded number of variables. This continues the work by Freydenberger and Reidenbach (In...
Joachim Bremer, Dominik D. Freydenberger
126
Voted
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
15 years 7 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis
98
Voted
ICIP
2005
IEEE
15 years 6 months ago
Chromatic adaptation and white-balance problem
The problem of adjusting the color such that the output image from a digital camera, viewed under a standard condition, matches the scene observed by the photographer’s eye is c...
Keigo Hirakawa, Thomas W. Parks
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 6 months ago
Computing the epistasis variance of large-scale traveling salesman problems
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
Dong-il Seo, Byung Ro Moon