86 search results - page 12 / 18 » Satisfiability Algorithms and Finite Quantification |
ACSD
2004
IEEE
15 years 1 months ago
2004
IEEE
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...
ACSD
2003
IEEE
15 years 1 months ago
2003
IEEE
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
109
click to vote
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
SIAMJO
2008
14 years 9 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...