Sciweavers

3946 search results - page 131 / 790
» The computational complexity of choice sets
Sort
View
ATAL
2006
Springer
15 years 10 months ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
CORR
2008
Springer
148views Education» more  CORR 2008»
15 years 6 months ago
A Non-differential Distributed Space-Time Coding for Partially-Coherent Cooperative Communication
In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them ...
Jagadeesh Harshan, B. Sundar Rajan
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 10 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
SIGOPSE
2004
ACM
15 years 12 months ago
An approach to benchmarking configuration complexity
Configuration is the process whereby components are assembled or adjusted to produce a functional system that operates at a specified level of performance. Today, the complexity o...
Aaron B. Brown, Joseph L. Hellerstein
RECOMB
2009
Springer
16 years 7 months ago
Haplotype Inference in Complex Pedigrees
Abstract. Despite the desirable information contained in complex pedigree datasets, analysis methods struggle to efficiently process these datasets. The attractiveness of pedigree ...
Bonnie Kirkpatrick, Javier Rosa, Eran Halperin, Ri...