Sciweavers

13603 search results - page 144 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
ECAL
2001
Springer
15 years 10 months 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»
16 years 3 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»
16 years 21 days 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
15 years 11 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. ...
PODS
2004
ACM
130views Database» more  PODS 2004»
16 years 6 months ago
Computational Complexity of Itemset Frequency Satisfiability
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
Toon Calders