Sciweavers

516 search results - page 31 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 10 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
INFORMS
2008
104views more  INFORMS 2008»
13 years 10 months ago
Estimating Cycle Time Percentile Curves for Manufacturing Systems via Simulation
Cycle time-throughput (CT-TH) percentile curves quantify the relationship between percentiles of cycle time and factory throughput, and they can play an important role in strategi...
Feng Yang, Bruce E. Ankenman, Barry L. Nelson
COCOON
2009
Springer
14 years 4 months ago
A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise
We present a polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. The Q-Ising, one of the generalized models of the Ising, arose in the context of Baye...
Masaki Yamamoto, Shuji Kijima, Yasuko Matsui
APSEC
2002
IEEE
14 years 2 months ago
Symbolic Simulation of Hybrid Systems
Continuous action systems (CAS) is a formalism intended for modeling hybrid systems (systems that combine discrete control with continuous behavior), and proving properties about ...
Ralph-Johan Back, Cristina Cerschi Seceleanu, Jan ...
SODA
2010
ACM
133views Algorithms» more  SODA 2010»
14 years 7 months ago
Testing additive integrality gaps
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör ...