Sciweavers

584 search results - page 8 / 117
» Combinatorial optimization problems in wireless switch desig...
Sort
View
CORR
2011
Springer
177views Education» more  CORR 2011»
13 years 2 months ago
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
Shaddin Dughmi
IJCAI
2001
13 years 9 months ago
Bundle Design in Robust Combinatorial Auction Protocol against False-name Bids
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 5 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
ICCCN
1998
IEEE
13 years 12 months ago
A Two-Phase Inter-Switch Handoff Scheme for Wireless ATM Networks
Supporting mobility in Wireless ATM networks poses a number of technical issues. An important issue is the ability to reroute ongoing virtual connections during handoff as mobile ...
Khaled Salah, Elias Drakopoulos
PPSN
2010
Springer
13 years 6 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl