Sciweavers

16188 search results - page 3053 / 3238
» The Optimal PAC Algorithm
Sort
View
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
15 years 1 months ago
Online Convex Programming and regularization in adaptive control
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...
Maxim Raginsky, Alexander Rakhlin, Serdar Yük...
CDC
2010
IEEE
111views Control Systems» more  CDC 2010»
15 years 1 months ago
Multi-robot monitoring in dynamic environments with guaranteed currency of observations
Abstract-- In this paper we consider the problem of monitoring a known set of stationary features (or locations of interest) in an environment. To observe a feature, a robot must v...
Stephen L. Smith, Daniela Rus
COR
2011
15 years 1 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
CORR
2011
Springer
273views Education» more  CORR 2011»
15 years 1 months ago
Natural Language Processing (almost) from Scratch
We propose a unified neural network architecture and learning algorithm that can be applied to various natural language processing tasks including: part-of-speech tagging, chunki...
Ronan Collobert, Jason Weston, Léon Bottou,...
CORR
2011
Springer
197views Education» more  CORR 2011»
15 years 1 months ago
Query Expansion Based on Clustered Results
Query expansion is a functionality of search engines that suggests a set of related queries for a user-issued keyword query. Typical corpus-driven keyword query expansion approach...
Ziyang Liu, Sivaramakrishnan Natarajan, Yi Chen
« Prev « First page 3053 / 3238 Last » Next »