2200 search results - page 169 / 440 » Bloch's Constant is Computable |
208
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
140
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The usual approach to deal with noise present in many realworld optimization problems is to take an arbitrary number of samples of the objective function and use the samp...
165
click to vote
ISAAC
2004
Springer
15 years 12 months 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 ...
181
click to vote
PERVASIVE
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we introduce a new distributed algorithm for location discovery. It can be used in wireless ad-hoc sensor networks that are equipped with means of measuring the dista...
173
click to vote
ACSC
2003
IEEE
15 years 11 months ago
2003
IEEE
We describe two algorithms for static path-planning, with the aim of deriving the trajectory that always maximises the distance of the path from the nearest obstacle. The bubble a...