Sciweavers

3433 search results - page 252 / 687
» Heuristics for a bidding problem
Sort
View
FCT
2007
Springer
15 years 10 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
ICC
2008
IEEE
161views Communications» more  ICC 2008»
16 years 1 months ago
Joint Power Control and Link Scheduling in Wireless Networks for Throughput Optimization
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...
Liqun Fu, Soung Chang Liew, Jianwei Huang
GECCO
2005
Springer
16 years 6 days ago
Towards an analysis of dynamic environments
Although the interest in nature-inspired optimization of dynamic problems has been growing constantly over the past decade, very little has been done to analyze and characterize a...
Jürgen Branke, Erdem Salihoglu, Sima Uyar
ATMOS
2010
163views Optimization» more  ATMOS 2010»
15 years 5 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin