1456 search results - page 34 / 292 » Improved Randomized Results for That Interval Selection Prob... |
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
ICNC
2009
Springer
15 years 4 months ago
2009
Springer
—With the aim to minimize boarding time and devise procedures for boarding strategies, this paper develop the synthesis of Improved Genetic Algorithms and simulation. This paper ...
WCNC
2010
IEEE
15 years 1 months ago
2010
IEEE
—This paper considers the medium access problem in the IEEE 802.11 standard. Although the transmission bit rates have clearly increased, some MAC related problems remain unsolved...
ICRA
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...