352 search results - page 22 / 71 » On the optimal reachability problem of weighted timed automa... |
101
Voted
EAAI
2008
15 years 13 days ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
82
Voted
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
112
Voted
FCCM
2005
IEEE
15 years 6 months ago
2005
IEEE
The CLA-EC is a model obtained by combining the concepts of cellular learning automata and evolutionary algorithms. The parallel structure of the CLA-EC makes it suitable for hard...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
ICASSP
2010
IEEE
15 years 17 days ago
2010
IEEE
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...