Sciweavers

5608 search results - page 271 / 1122
» On the Theory of Matchgate Computations
Sort
View
JACM
2010
116views more  JACM 2010»
15 years 5 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
SAGT
2010
Springer
191views Game Theory» more  SAGT 2010»
15 years 5 months ago
Complexity of Safe Strategic Voting
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
Noam Hazon, Edith Elkind
SAGT
2010
Springer
156views Game Theory» more  SAGT 2010»
15 years 5 months ago
Partition Equilibrium Always Exists in Resource Selection Games
Abstract. We consider the existence of Partition Equilibrium in Resource Selection Games. Super-strong equilibrium, where no subset of players has an incentive to change their stra...
Elliot Anshelevich, Bugra Caskurlu, Ameya Hate
ACMSE
2010
ACM
15 years 4 months ago
Automatic generation of model traversals from metamodel definitions
Developing software from models is a growing practice and there exist many model-based tools (e.g., model editors, model interpreters) for supporting model-driven engineering. Eve...
Tomaz Lukman, Marjan Mernik, Zekai Demirezen, Barr...
MOBIHOC
2010
ACM
15 years 4 months ago
Longest-queue-first scheduling under SINR interference model
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...
Long Bao Le, Eytan Modiano, Changhee Joo, Ness B. ...