Sciweavers

3328 search results - page 580 / 666
» Topological Quantum Computation
Sort
View
TEC
2002
117views more  TEC 2002»
13 years 9 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
RAS
2007
113views more  RAS 2007»
13 years 9 months ago
From images to rooms
In this paper we start from a set of images obtained by the robot that is moving around in an environment. We present a method to automatically group the images into groups that c...
Zoran Zivkovic, Olaf Booij, Ben J. A. Kröse
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 8 months ago
Discrete Laplace-Beltrami Operator Determines Discrete Riemannian Metric
The Laplace-Beltrami operator of a smooth Riemannian manifold is determined by the Riemannian metric. Conversely, the heat kernel constructed from its eigenvalues and eigenfunctio...
Xianfeng David Gu, Ren Guo, Feng Luo 0002, Wei Zen...
LATIN
2010
Springer
13 years 8 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
RSA
2010
89views more  RSA 2010»
13 years 8 months ago
Some remarks on Betti numbers of random polygon spaces
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
Clément Dombry, Christian Mazza