1331 search results - page 130 / 267 » Complexity bounds for zero-test algorithms |
EMO
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The optimization and design of two different types of photonic devices - a Fibre Bragg Grating and a Microstructured Polymer Optical Fibre is presented in light of multi...
ANOR
2011
13 years 1 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
ESA
1998
Springer
14 years 2 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
APPROX
2008
Springer
14 years 7 days ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
IDA
1997
Springer
14 years 2 months ago
1997
Springer
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...