1743 search results - page 96 / 349 » Generalized Modal Satisfiability |
117
Voted
ITSSA
2006
15 years 22 days ago
2006
: General purpose workflow management systems are often unable to match user requirements of a particular application. In many points of the workflow the user has to take decisions...
89
Voted
JNSM
2006
15 years 22 days ago
2006
Two bounds on network coding rates are reviewed that generalize edge-cut bounds on routing rates. The simpler bound is a bidirected cut-set bound which generalizes and improves upo...
76
Voted
TWC
2008
15 years 19 days ago
2008
A stronger and general sufficient condition for the asymptotic normality of MIMO channel eigenvalues and its capacity is given. Physical interpretation of this condition is discuss...
98
Voted
CORR
2010
Springer
15 years 10 days ago
2010
Springer
Abstract. We introduce a new class of games called the networked common goods game (NCGG), which generalizes the well-known common goods game [12]. We focus on a fairly general sub...
DAC
2003
ACM
16 years 1 months ago
2003
ACM
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...