4894 search results - page 648 / 979 » The Guarding Problem - Complexity and Approximation |
132
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
115
click to vote
ACISICIS
2009
IEEE
15 years 7 months ago
2009
IEEE
—This paper presents a parallel algorithm for computer simulation of Electrocardiogram (ECG) based on a 3-dimensional (3D) whole-heart model. The computer heart model includes ap...
125
click to vote
WSC
2008
15 years 6 months ago
2008
Semiconductor fabs often offer manufacturing service of multiple priorities in terms of cycle time-based X-factor targets (XFTs) and fab production must be planned accordingly. Th...
135
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problem...
144
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...