Sciweavers

3991 search results - page 189 / 799
» Bounding homogeneous models
Sort
View
EUROPAR
2005
Springer
14 years 1 months ago
Replication Predicates for Dependent-Failure Algorithms
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
Flavio Paiva Junqueira, Keith Marzullo
JCSS
2008
96views more  JCSS 2008»
13 years 8 months ago
A combinatorial characterization of resolution width
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
Albert Atserias, Víctor Dalmau
TCOM
2008
106views more  TCOM 2008»
13 years 8 months ago
Performance analysis on LDPC-Coded systems over quasi-static (MIMO) fading channels
In this paper, we derive closed form upper bounds on the error probability of low-density parity-check (LDPC) coded modulation schemes operating on quasi-static fading channels. Th...
Jingqiao Zhang, Heung-No Lee
LMCS
2007
132views more  LMCS 2007»
13 years 8 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
GECCO
2007
Springer
214views Optimization» more  GECCO 2007»
14 years 2 months ago
Portfolio allocation using XCS experts in technical analysis, market conditions and options market
Schulenburg [15] first proposed the idea to model different trader types by supplying different input information sets to a group of homogenous LCS agent. Gershoff [12] investigat...
Sor Ying (Byron) Wong, Sonia Schulenburg