4112 search results - page 466 / 823 » Efficient Algorithms for the Spoonerism Problem |
200
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
239
click to vote
MOBIHOC
2006
ACM
16 years 7 months ago
2006
ACM
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
206
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
—This paper focuses on routing tree construction problem and its influence on the performance of utilizing centralized scheduling in IEEE 802.16 mesh networks. We apply three rou...
217
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
The conversion and extension of the Incremental ParetoCoevolution Archive algorithm (IPCA) into the domain of Genetic Programming classifier evolution is presented. In order to ac...
209
click to vote
MASCOTS
2010
15 years 9 months ago
2010
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points,...