Sciweavers

2436 search results - page 72 / 488
» Evaluating Adaptive Problem Selection
Sort
View
COLT
2004
Springer
14 years 2 months ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum
ANLP
1997
80views more  ANLP 1997»
13 years 10 months ago
Sequential Model Selection for Word Sense Disambiguation
Statistical models of word-sense disambiguation are often based on a small number of contextual features or on a model that is assumed to characterize the interactions among a set...
Ted Pedersen, Rebecca F. Bruce, Janyce Wiebe
JSAC
2011
215views more  JSAC 2011»
13 years 3 months ago
Opportunistic Spectrum Sharing Schemes for CDMA-Based Uplink MAC in Cognitive Radio Networks
—We consider a wireless cognitive radio network in which a set of secondary users (SUs) opportunistically utilize the wireless spectrum licensed to the primary users (PUs) to tra...
Xi Zhang, Hang Su
BTW
2005
Springer
118views Database» more  BTW 2005»
14 years 2 months ago
The MINERVA Project: Database Selection in the Context of P2P Search
: This paper presents the MINERVA project that protoypes a distributed search engine based on P2P techniques. MINERVA is layered on top of a Chord-style overlay network and uses a ...
Matthias Bender, Sebastian Michel, Gerhard Weikum,...
ICRA
2009
IEEE
170views Robotics» more  ICRA 2009»
14 years 3 months ago
Path diversity is only part of the problem
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...
Ross A. Knepper, Matthew T. Mason