486 search results - page 23 / 98 » Improved upper bounds for 3-SAT |
APN
1999
Springer
14 years 23 days ago
1999
Springer
Abstract. Symbolic techniques based on BDDs (Binary Decision Diagrams) have emerged as an e cient strategy for the analysis of Petri nets. The existing techniques for the symbolic ...
ICASSP
2011
IEEE
13 years 5 days ago
2011
IEEE
This paper addresses the optimization of upper and lower bounds on the capacity of the multiple-input multiple-output (MIMO) relay channel. In particular, we show that evaluating ...
COCOON
2007
Springer
14 years 12 days ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
NAACL
2010
13 years 6 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
CIAC
2010
Springer
14 years 6 days ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...