Sciweavers

269 search results - page 41 / 54
» Optimal Randomized Algorithms for Local Sorting and Set-Maxi...
Sort
View
AAAI
1997
13 years 8 months ago
Tabu Search for SAT
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
Bertrand Mazure, Lakhdar Sais, Éric Gr&eacu...
TCOM
2010
167views more  TCOM 2010»
13 years 5 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho
TITB
2010
151views Education» more  TITB 2010»
13 years 2 months ago
An adaptive Monte Carlo approach to phase-based multimodal image registration
In this paper, a novel multiresolution algorithm for registering multimodal images, using an adaptive Monte Carlo scheme is presented. At each iteration, random solution candidates...
Alexander Wong
PODC
2011
ACM
12 years 10 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
ALMOB
2007
151views more  ALMOB 2007»
13 years 7 months ago
Local sequence alignments statistics: deviations from Gumbel statistics in the rare-event tail
Background: The optimal score for ungapped local alignments of infinitely long random sequences is known to follow a Gumbel extreme value distribution. Less is known about the imp...
Stefan Wolfsheimer, Bernd Burghardt, Alexander K. ...