Sciweavers

16404 search results - page 311 / 3281
» A set coverage problem
Sort
View
ICALP
2005
Springer
15 years 10 months ago
The Generalized Deadlock Resolution Problem
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwa...
BMCBI
2006
100views more  BMCBI 2006»
15 years 4 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
ICRA
2009
IEEE
259views Robotics» more  ICRA 2009»
15 years 11 months ago
Constructing action set from basis functions for reinforcement learning of robot control
Abstract— Continuous action sets are used in many reinforcement learning (RL) applications in robot control since the control input is continuous. However, discrete action sets a...
Akihiko Yamaguchi, Jun Takamatsu, Tsukasa Ogasawar...
AIPS
1998
15 years 6 months ago
Solving Stochastic Planning Problems with Large State and Action Spaces
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
Thomas Dean, Robert Givan, Kee-Eung Kim
COR
2000
129views more  COR 2000»
15 years 4 months ago
Heuristics for the multi-vehicle covering tour problem
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
Mondher Hachicha, M. John Hodgson, Gilbert Laporte...