42230 search results - page 5 / 8446 » Algorithms and Complexity Results for |
ISAAC
2004
Springer
14 years 21 days ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
COMPGEOM
2004
ACM
14 years 23 days ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
JSC
2007
13 years 7 months ago
2007
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
DGCI
2008
Springer
13 years 9 months ago
2008
Springer
This paper presents the first segmentation operation defined within the 3D topological map framework. Firstly we show how a traditional segmentation algorithm, found in the literat...
CEC
2005
IEEE
14 years 29 days ago
2005
IEEE
Abstract- Seeding the population of an evolutionary algorithm with solutions from previous runs has proved to be useful when learning control strategies for agents operating in a c...