3055 search results - page 172 / 611 » Randomized Search Trees |
92
Voted
ASPDAC
2004
ACM
15 years 6 months ago
2004
ACM
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
106
click to vote
ISAAC
2003
Springer
15 years 5 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
121
Voted
SIBGRAPI
1999
IEEE
15 years 5 months ago
1999
IEEE
Texture analysis and synthesis is very important for computer graphics, vision, and image processing. This paper describes an algorithm which can produce new textures with a matchi...
99
Voted
BROADCOM
2008
IEEE
15 years 2 months ago
2008
IEEE
In this paper we propose and analyze an efficient flooding technique for static multi-hop wireless networks. The protocol builds up a routing tree that connects all network nodes....
109
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...