Sciweavers

543 search results - page 75 / 109
» New Upper Bounds for MaxSat
Sort
View
LICS
1997
IEEE
15 years 1 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
CONCUR
1997
Springer
15 years 1 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler
ISLPED
1996
ACM
110views Hardware» more  ISLPED 1996»
15 years 1 months ago
Statistical estimation of average power dissipation in CMOS VLSI circuits using nonparametric techniques
In this paper, we present a new statistical technique for estimation of average power dissipation in digital circuits. Present statistical techniques estimate the average power ba...
Li-Pen Yuan, Chin-Chi Teng, Sung-Mo Kang
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 1 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
COMPGEOM
1995
ACM
15 years 1 months ago
Searching for the Kernel of a Polygon - A Competitive Strategy
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
Christian Icking, Rolf Klein