Sciweavers

1404 search results - page 128 / 281
» Optimization problems in multiple-interval graphs
Sort
View
REX
1991
15 years 1 months ago
The Theory of Timed Automata
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
Rajeev Alur, David L. Dill
DAC
2003
ACM
15 years 11 months ago
Partial task assignment of task graphs under heterogeneous resource constraints
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
Radoslaw Szymanek, Krzysztof Kuchcinski
IPSN
2005
Springer
15 years 3 months ago
Tracking on a graph
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
Songhwai Oh, Shankar Sastry
JDA
2007
129views more  JDA 2007»
14 years 9 months ago
Approximating the k-traveling repairman problem with repairtimes
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
Raja Jothi, Balaji Raghavachari
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
15 years 3 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor