Sciweavers

1225 search results - page 146 / 245
» The Instance Complexity Conjecture
Sort
View
AAAI
2007
13 years 11 months ago
On the Partial Observability of Temporal Uncertainty
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
Michael D. Moffitt
FAST
2004
13 years 10 months ago
Buttress: A Toolkit for Flexible and High Fidelity I/O Benchmarking
In benchmarking I/O systems, it is important to generate, accurately, the I/O access pattern that one is intending to generate. However, timing accuracy ( issuing I/Os at the desi...
Eric Anderson, Mahesh Kallahalla, Mustafa Uysal, R...
BPM
2009
Springer
143views Business» more  BPM 2009»
13 years 10 months ago
MDPE Workbench - A Solution for Performance Related Decision Support
Abstract. Continuous optimization of business process execution including its adaptation to changes within the market environment or the company itself becomes increasingly importa...
Mathias Fritzsche, Jendrik Johannes, Sebastian Cec...
COR
2008
111views more  COR 2008»
13 years 9 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
13 years 9 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak