Sciweavers

186 search results - page 16 / 38
» Priority Algorithms for the Subset-Sum Problem
Sort
View
ICALP
2010
Springer
13 years 9 months ago
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
Allan Borodin, Brendan Lucier
VTC
2008
IEEE
224views Communications» more  VTC 2008»
14 years 2 months ago
Dynamic Spectrum Allocation in Wireless Cognitive Sensor Networks: Improving Fairness and Energy Efficiency
Abstract- This paper considers the centralized spectrum allocations in resource-constrained wireless sensor networks with the following goals: (1) allocate spectrum as fairly as po...
Sang-Seon Byun, Ilangko Balasingham, Xuedong Liang
ICPP
2009
IEEE
13 years 5 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
GECCO
2005
Springer
122views Optimization» more  GECCO 2005»
14 years 1 months ago
Map-labelling with a multi-objective evolutionary algorithm
We present a multi-objective evolutionary algorithm approach to the map-labelling problem. Map-labelling involves placing labels for sites onto a map such that the result is easy ...
Lucas Bradstreet, Luigi Barone, R. Lyndon While
GLOBECOM
2010
IEEE
13 years 5 months ago
Dynamic Channel Selection in Cognitive Radio Network with Channel Heterogeneity
We consider the channel selection problem in a cognitive radio network with heterogenous channel availabilities at different nodes. We formulate the maximum channel selection (MCS)...
Fen Hou, Jianwei Huang