Sciweavers

14158 search results - page 451 / 2832
» Generalized switch-setting problems
Sort
View
ICSE
2012
IEEE-ACM
13 years 8 months ago
Axis: Automatically fixing atomicity violations through solving control constraints
Abstract—Atomicity, a general correctness criterion in concurrency programs, is often violated in real-world applications. The violations are difficult for developers to fix, m...
Peng Liu, Charles Zhang
EOR
2000
98views more  EOR 2000»
15 years 6 months ago
Optimal planning in large multi-site production networks
This contribution describes a general mixed-integer linear programming model based on a time-indexed formulation covering the relevant features required for the complete supply ch...
Christian Timpe, Josef Kallrath
FUIN
2000
68views more  FUIN 2000»
15 years 6 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
SIAMJO
2000
108views more  SIAMJO 2000»
15 years 6 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
AI
1998
Springer
15 years 5 months ago
Recovery of (Non)Monotonic Theories
We present a framework for recovery of nonmonotonic theories, i.e. of theories that are interpreted using a nonmonotonic semantics. Recovery of a nonmonotonic theory is needed if ...
Cees Witteveen, Wiebe van der Hoek