Sciweavers

4377 search results - page 501 / 876
» Mass problems and randomness
Sort
View
196
Voted
TRANSCI
2008
122views more  TRANSCI 2008»
15 years 6 months ago
Scheduling Locomotives and Car Transfers in Freight Transport
Abstract. We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation th...
Armin Fügenschuh, Henning Homfeld, Andreas Hu...
AIR
2004
130views more  AIR 2004»
15 years 6 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
DCG
2000
104views more  DCG 2000»
15 years 6 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan
IEE
2002
72views more  IEE 2002»
15 years 6 months ago
Making inferences with small numbers of training sets
This paper discusses a potential methodological problem with empirical studies assessing project effort prediction systems. Frequently a hold-out strategy is deployed so that the ...
Colin Kirsopp, Martin J. Shepperd
TCAD
2002
121views more  TCAD 2002»
15 years 6 months ago
Robust Boolean reasoning for equivalence checking and functional property verification
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
Andreas Kuehlmann, Viresh Paruthi, Florian Krohm, ...