1242 search results - page 83 / 249 » A Computational Complexity Theory in Membrane Computing |
158
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
182
Voted
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
238
click to vote
PODC
2012
ACM
13 years 8 months ago
2012
ACM
The BGP (Border Gateway Protocol) is the single inter-domain routing protocol that enables network operators within each autonomous system (AS) to influence routing decisions by ...
138
click to vote
ATAL
2007
Springer
16 years 7 days ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
159
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...