Sciweavers

4066 search results - page 13 / 814
» Improved Algorithms and Analysis for Secretary Problems and ...
Sort
View
ISAAC
2005
Springer
76views Algorithms» more  ISAAC 2005»
15 years 9 months ago
Improved Algorithms for the k Maximum-Sums Problems
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-...
ALGOSENSORS
2009
Springer
15 years 10 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
CVPR
2011
IEEE
14 years 7 months ago
Global Optimization for Optimal Generalized Procrustes Analysis
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by estimating a reference shape and a set of rigid transformations gi...
Daniel Pizarro, Adrien Bartoli
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
15 years 7 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 4 months ago
Improved results for a memory allocation problem
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
Leah Epstein, Rob van Stee