5995 search results - page 228 / 1199 » Algorithmic Game Theory |
177
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
185
Voted
WASA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. It has been long recognized that the interference among concurrent wireless transmissions plays a crucial role in limiting the performance of wireless networks. Recently,...
133
Voted
CIE
2005
Springer
15 years 11 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
178
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
160
Voted
CPAIOR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...