874 search results - page 26 / 175 » Faster Algorithms for Semi-Matching Problems |
SODA
2000
ACM
13 years 9 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
AIEDAM
2008
13 years 7 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
NICSO
2010
Springer
13 years 11 months ago
2010
Springer
t] Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for comple...
ALGOSENSORS
2006
Springer
13 years 11 months ago
2006
Springer
Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a xed infrastructure. Fast self-recon guration and power eci...