Sciweavers

794 search results - page 2 / 159
» Improved algorithms for orienteering and related problems
Sort
View
GECCO
1999
Springer
115views Optimization» more  GECCO 1999»
13 years 9 months ago
A Diversity Study in Genetic Algorithms for Job Shop Scheduling Problems
This paper deals with the study of population diversity in Genetic Algorithms for Job Shop Scheduling Problems. A definition of population diversity at the phenotype level and a ...
Carlos A. Brizuela, Nobuo Sannomiya
CDC
2008
IEEE
150views Control Systems» more  CDC 2008»
13 years 11 months ago
On frame and orientation localization for relative sensing networks
We develop a novel localization theory for planar networks of nodes that measure each other’s relative position, i.e., we assume that nodes do not have the ability to perform me...
Giulia Piova, Iman Shames, Baris Fidan, Francesco ...
ISMAR
2008
IEEE
13 years 11 months ago
Relative pose calibration of a spherical camera and an IMU
This paper is concerned with the problem of estimating the relative translation and orientation of an inertial measurement unit and a spherical camera, which are rigidly connected...
Jeroen D. Hol, Thomas B. Schön, Fredrik Gusta...
PAIRING
2007
Springer
13 years 11 months ago
Remarks on Cheon's Algorithms for Pairing-Related Problems
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
Shunji Kozaki, Taketeru Kutsuma, Kazuto Matsuo
MOR
2000
162views more  MOR 2000»
13 years 4 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan