Sciweavers

69 search results - page 11 / 14
» esa 2009
Sort
View
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
13 years 11 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...
ICC
2009
IEEE
124views Communications» more  ICC 2009»
14 years 2 months ago
Towards a GNU/Linux IEEE 802.21 Implementation
—Multiaccess mobile devices and overlapping wireless network deployments have emerged as a next generation network fixture. To make the most of all available networks, mobile de...
Esa Piri, Kostas Pentikousis
ESA
2009
Springer
99views Algorithms» more  ESA 2009»
14 years 2 months ago
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
Chandra Chekuri, Sungjin Im, Benjamin Moseley
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 2 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
ESA
2009
Springer
139views Algorithms» more  ESA 2009»
14 years 2 months ago
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
Abstract. A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sen...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc