Sciweavers

4526 search results - page 133 / 906
» Algorithmic problems related to the Internet
Sort
View
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
15 years 9 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
ICLP
1999
Springer
15 years 8 months ago
Finding Fair Allocations for the Coalition Problem with Constraints
Fair allocation of payoffs among cooperating players who can form various coalitions of differing utilities is the classic game theoretic “coalition problem.” Shapley’s va...
Evan Tick, Roland H. C. Yap, Michael J. Maher
ADCM
2008
111views more  ADCM 2008»
15 years 4 months ago
Sigma-delta quantization errors and the traveling salesman problem
In transmission, storaging and coding of digital signals we frequently perform A/D conversion using quantization. In this paper we study the maxiaml and mean square errors as a res...
Yang Wang
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
15 years 5 months ago
Solving constrained multi-objective problems by objective space analysis
In this paper a new approach to solve constrained multi-objective problems by way of evolutionary multi-objective optimization is introduced. In contrast to former evolutionary ap...
Gideon Avigad, Carlos A. Coello Coello
INFOCOM
2009
IEEE
15 years 11 months ago
Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
Chee-Wei Tan, Mung Chiang, R. Srikant