Sciweavers

5214 search results - page 20 / 1043
» The Online Specialization Problem
Sort
View
ICRA
2009
IEEE
91views Robotics» more  ICRA 2009»
14 years 2 months ago
Specialization as an optimal strategy under varying external conditions
— We present an investigation of specialization when considering the execution of collaborative tasks by a robot swarm. Specifically, we consider the stick-pulling problem firs...
M. Ani Hsieh, Ádám M. Halász,...
JMLR
2002
78views more  JMLR 2002»
13 years 7 months ago
Shallow Parsing using Specialized HMMs
We present a unified technique to solve different shallow parsing tasks as a tagging problem using a Hidden Markov Model-based approach (HMM). This technique consists of the incor...
Antonio Molina, Ferran Pla
ESA
2005
Springer
125views Algorithms» more  ESA 2005»
14 years 1 months ago
Online Primal-Dual Algorithms for Covering and Packing Problems
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
Niv Buchbinder, Joseph Naor
SADFE
2009
IEEE
14 years 2 months ago
File Fragment Classification-The Case for Specialized Approaches
Increasingly advances in file carving, memory analysis and network forensics requires the ability to identify the underlying type of a file given only a file fragment. Work to dat...
Vassil Roussev, Simson L. Garfinkel
NCI
2004
185views Neural Networks» more  NCI 2004»
13 years 9 months ago
Hierarchical reinforcement learning with subpolicies specializing for learned subgoals
This paper describes a method for hierarchical reinforcement learning in which high-level policies automatically discover subgoals, and low-level policies learn to specialize for ...
Bram Bakker, Jürgen Schmidhuber