Sciweavers

28888 search results - page 126 / 5778
» Computability and complexity in analysis
Sort
View
CIE
2005
Springer
14 years 1 months ago
The Computational Complexity of One-Dimensional Sandpiles
Abstract. We prove that the one-dimensional sandpile prediction problem is in AC1 . The previously best known upper bound on the ACi -scale was AC2 . We also prove that it is not i...
Peter Bro Miltersen
ECAL
2001
Springer
14 years 18 days ago
Emergent Syntax: The Unremitting Value of Computational Modeling for Understanding the Origins of Complex Language
Abstract. In this paper we explore the similarities between a mathematical model of language evolution and several A-life simulations. We argue that the mathematical model makes so...
Willem H. Zuidema
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 5 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
SAGT
2009
Springer
131views Game Theory» more  SAGT 2009»
14 years 2 months ago
The Computational Complexity of Weak Saddles
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
Felix Brandt, Markus Brill, Felix A. Fischer, Jan ...
WG
2004
Springer
14 years 1 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...