3897 search results - page 60 / 780 » complexity 2010 |
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
LATA
2010
Springer
14 years 5 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
ASUNAM
2010
IEEE
13 years 9 months ago
2010
IEEE
This paper aims at studying the roles of social features (as obtained from social networking sources) in buyers' decision process when they are searching for products to buy. ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...