10608 search results - page 137 / 2122 » Complexity of O'Hara's Algorithm |
105
Voted
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
98
Voted
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
111
click to vote
IS
2008
15 years 17 days ago
2008
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
99
Voted
ICLP
2001
Springer
15 years 5 months ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...