Sciweavers

604 search results - page 86 / 121
» Stochastic Offline Programming
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
CDC
2008
IEEE
131views Control Systems» more  CDC 2008»
15 years 4 months ago
Explicit model predictive control for linear parameter-varying systems
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
Thomas Besselmann, Johan Löfberg, Manfred Mor...
ICAC
2005
IEEE
15 years 3 months ago
Quickly Finding Known Software Problems via Automated Symptom Matching
We present an architecture for and prototype of a system for quickly detecting software problem recurrences. Re-discovery of the same problem is very common in many large software...
Mark Brodie, Sheng Ma, Guy M. Lohman, Laurent Mign...
DFT
2003
IEEE
64views VLSI» more  DFT 2003»
15 years 3 months ago
Hybrid BIST Time Minimization for Core-Based Systems with STUMPS Architecture
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
Gert Jervan, Petru Eles, Zebo Peng, Raimund Ubar, ...
ESORICS
1994
Springer
15 years 1 months ago
The ESPRIT Project CAFE - High Security Digital Payment Systems
CAFE ("Conditional Access for Europe") is an ongoing project in the European Community's ESPRIT program. The goal of CAFE is to develop innovative systems for condit...
Jean-Paul Boly, Antoon Bosselaers, Ronald Cramer, ...