Sciweavers

6393 search results - page 95 / 1279
» Randomized Algorithms on the Mesh
Sort
View
130
Voted
MOBICOM
2006
ACM
15 years 9 months ago
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
128
Voted
WCNC
2008
IEEE
15 years 9 months ago
Adaptive Split Transmission for Video Streams in Wireless Mesh Networks
— Wireless mesh networks hold great promise in the wireless transmission of video flows, particularly if the problem of providing sufficient network capacity can be addressed. ...
Wanqing Tu, Cormac J. Sreenan
99
Voted
SIGGRAPH
1998
ACM
15 years 7 months ago
Real Time Compression of Triangle Mesh Connectivity
In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough...
Stefan Gumhold, Wolfgang Straßer
114
Voted
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
15 years 9 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
108
Voted
GECCO
2006
Springer
153views Optimization» more  GECCO 2006»
15 years 7 months ago
On the local performance of simulated annealing and the (1+1) evolutionary algorithm
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
Thomas Jansen, Ingo Wegener