Sciweavers

1772 search results - page 287 / 355
» Classifying Problems into Complexity Classes
Sort
View
MFCS
2009
Springer
14 years 2 months ago
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
Nadja Betzler, Britta Dorn
JAIR
2006
87views more  JAIR 2006»
13 years 10 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy

Publication
295views
12 years 8 months ago
The Age of Analog Networks.
A large class of systems of biological and technological relevance can be described as analog networks, that is, collections of dynamic devices interconnected by links of varying s...
Claudio Mattiussi, Daniel Marbach, Peter Dürr, Da...
ATAL
2009
Springer
14 years 4 months ago
False name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Haris Aziz, Mike Paterson
LPAR
1999
Springer
14 years 2 months ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies