Sciweavers

5214 search results - page 290 / 1043
» The Online Specialization Problem
Sort
View
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 6 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
IEEEARES
2007
IEEE
16 years 1 months ago
A Pattern System for Security Requirements Engineering
We present a pattern system for security requirements engineering, consisting of security problem frames and concretized security problem frames. These are special kinds of proble...
Denis Hatebur, Maritta Heisel, Holger Schmidt
TACAS
2007
Springer
118views Algorithms» more  TACAS 2007»
16 years 25 days ago
Checking Pedigree Consistency with PCS
Abstract. Many important problems in bioinformatics and genetics require analyses that are NP-complete. For example, one of the basic problems facing researchers that analyze pedig...
Panagiotis Manolios, Marc Galceran Oms, Sergi Oliv...
HICSS
2002
IEEE
135views Biometrics» more  HICSS 2002»
15 years 11 months ago
Integrated Production Planning and Route Scheduling in Pulp Mill Industry
In this paper we consider the complete supply chain for a large pulp producer in Sweden. The supply chain is divided up in two parts, the pulp production planning problem and the ...
David Bredström, Mikael Rönnqvist
CP
1999
Springer
15 years 11 months ago
A Framework for Constraint Programming Based Column Generation
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo ...