881 search results - page 41 / 177 » Solving satisfiability problems with preferences |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
SIGDOC
2006
ACM
14 years 2 months ago
2006
ACM
While earlier work provided a partial view of users’ preferences about manuals, for most users in most work contexts the important question remains open: What do users want in d...
SEMWEB
2010
Springer
13 years 6 months ago
2010
Springer
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
COCO
2004
Springer
14 years 13 days ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
SIAMDM
2010
13 years 3 months ago
2010
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...