Sciweavers

21324 search results - page 4202 / 4265
» Making the case for computing
Sort
View
143
Voted
ATAL
2006
Springer
15 years 4 months ago
Mertacor: a successful autonomous trading agent
In this paper we present the internal architecture and bidding mechanisms designed for Mertacor, a successful trading agent, which ended up first in the Classic Trading Agent Comp...
Panos Toulis, Dionisis Kehagias, Pericles A. Mitka...
134
Voted
CLEF
2008
Springer
15 years 4 months ago
UJM at ImageCLEFwiki 2008
This paper reports our multimedia information retrieval experiments carried out for the ImageCLEF track (ImageCLEFwiki). The task is to answer to user information needs, i.e. quer...
Christophe Moulin, Cécile Barat, Mathias G&...
COLT
2008
Springer
15 years 4 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
144
Voted
DALT
2008
Springer
15 years 4 months ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
101
Voted
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
15 years 4 months ago
Stabbing Convex Polygons with a Segment or a Polygon
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. G...
« Prev « First page 4202 / 4265 Last » Next »