17366 search results - page 429 / 3474 » New Revision Algorithms |
162
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Given limited or incomplete measurement data on a sphere, a new iterative algorithm is proposed on how to extrapolate signal over the whole sphere. The algorithm is based on a pri...
204
click to vote
WEA
2007
Springer
16 years 1 months ago
2007
Springer
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s a...
181
click to vote
MFCS
2005
Springer
16 years 11 days ago
2005
Springer
A sequential algorithm just follows its instructions and thus cannot make a nondeterministic choice all by itself, but it can be instructed to solicit outside help to make a choic...
199
click to vote
WADS
2005
Springer
16 years 10 days ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...
168
click to vote
GECCO
2004
Springer
16 years 8 days ago
2004
Springer
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...