Sciweavers

16404 search results - page 678 / 3281
» A set coverage problem
Sort
View
ATMOS
2010
163views Optimization» more  ATMOS 2010»
15 years 6 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
LICS
2005
IEEE
16 years 24 days ago
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significa...
Jérôme Leroux
ICML
2005
IEEE
16 years 8 months ago
Heteroscedastic Gaussian process regression
This paper presents an algorithm to estimate simultaneously both mean and variance of a non parametric regression problem. The key point is that we are able to estimate variance l...
Alexander J. Smola, Quoc V. Le, Stéphane Ca...
ICFEM
2009
Springer
16 years 1 months ago
Symbolic Query Exploration
Abstract. We study the problem of generating a database and parameters for a given parameterized SQL query satisfying a given test condition. We introduce a formal background theor...
Margus Veanes, Pavel Grigorenko, Peli de Halleux, ...
HM
2007
Springer
118views Optimization» more  HM 2007»
16 years 1 months ago
Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop
This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid meta...
Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz ...