Sciweavers

4110 search results - page 388 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
WINE
2010
Springer
164views Economy» more  WINE 2010»
15 years 4 months ago
Incentives in Online Auctions via Linear Programming
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
Niv Buchbinder, Kamal Jain, Mohit Singh
195
Voted
ECAI
2006
Springer
15 years 10 months ago
A Learning Classifier Approach to Tomography
Tomography is an important technique for noninvasive imaging: images of the interior of an object are computed from several scanned projections of the object, covering a range of a...
Kees Joost Batenburg
GECCO
2006
Springer
116views Optimization» more  GECCO 2006»
15 years 10 months ago
A crossover for complex building blocks overlapping
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
ECAI
2010
Springer
15 years 7 months ago
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
Sylvain Bouveret, Ulle Endriss, Jérôm...