Sciweavers

14518 search results - page 152 / 2904
» Two Problems for Sophistication
Sort
View
EOR
2010
104views more  EOR 2010»
13 years 7 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
JSCIC
2010
136views more  JSCIC 2010»
13 years 5 months ago
Multiple Level Sets for Piecewise Constant Surface Reconstruction in Highly Ill-Posed Problems
This paper considers highly ill-posed surface recovery inverse problems, where the sought surface in 2D or 3D is piecewise constant with several possible level values. These level...
K. van den Doel, U. M. Ascher, A. Leitão
IWPEC
2009
Springer
14 years 5 months ago
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
Panos Giannopoulos, Christian Knauer, Günter ...
AIMSA
2008
Springer
14 years 4 months ago
Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
Zhipeng Lü, Jin-Kao Hao
ICTCS
2005
Springer
14 years 3 months ago
Quantum Algorithms for a Set of Group Theoretic Problems
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
Stephen A. Fenner, Yong Zhang