Sciweavers

537 search results - page 66 / 108
» A new upper bound for 3-SAT
Sort
View
ESA
2009
Springer
130views Algorithms» more  ESA 2009»
14 years 3 months ago
On the Performance of Approximate Equilibria in Congestion Games
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
George Christodoulou, Elias Koutsoupias, Paul G. S...
QEST
2007
IEEE
14 years 2 months ago
Stochastic Game Logic
Stochastic game logic (SGL) is a new temporal logic that combines features of alternating temporal logic (to formalize the individual views and cooperation and reaction facilities...
Christel Baier, Tomás Brázdil, Marcu...
ICDT
2007
ACM
143views Database» more  ICDT 2007»
14 years 2 months ago
Database Query Processing Using Finite Cursor Machines
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what...
Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole...
SOFSEM
2007
Springer
14 years 2 months ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
Markus Maier, Steffen Mecke, Dorothea Wagner
GLOBECOM
2006
IEEE
14 years 2 months ago
Wormhole Attack in Wireless Ad Hoc Networks: Analysis and Countermeasure
— The wormhole attack is one of the most severe security attacks in wireless ad hoc networks. In this paper, we analyze the effect of the wormhole attack in shortest path routing...
Majid Khabbazian, Hugues Mercier, Vijay K. Bhargav...