6393 search results - page 196 / 1279 » Randomized Algorithms on the Mesh |
131
click to vote
IJCNN
2007
IEEE
15 years 10 months ago
2007
IEEE
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
119
click to vote
CEC
2007
IEEE
15 years 5 months ago
2007
IEEE
— Efficient discovery of lowest level building blocks is a fundamental requirement for a successful genetic algorithm. Although considerable effort has been directed at techniqu...
128
Voted
APPROX
2000
Springer
15 years 8 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
123
click to vote
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
This paper introduces a new stochastic surface model for deformable 3D surfaces and demonstrates its utility for the purpose of 3D sculpting. This is the problem of simple-touse a...
143
click to vote
ICOIN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...