2570 search results - page 240 / 514 » Fast Algorithms For The Computation Of Ranklets |
124
click to vote
ICIP
2002
IEEE
16 years 5 months ago
2002
IEEE
Bayesian reconstruction methods are slow and have been avoided in 3D ultrasound, since fast algorithms are required. This paper tries to overcome this difficulty by presenting a f...
135
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
198
click to vote
AI
1998
Springer
15 years 8 months ago
1998
Springer
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
222
click to vote
WAE
2001
15 years 5 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
135
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...