6582 search results - page 108 / 1317 » The focus of attention problem |
131
click to vote
EVOW
2005
Springer
15 years 12 months ago
2005
Springer
We focus on the Golomb ruler problem, a hard constrained combinatorial optimization problem. Two alternative encodings are considered, one based on the direct representation of sol...
143
click to vote
GCC
2003
Springer
15 years 11 months ago
2003
Springer
Time constraint is a key problem in workflow management. Now, with the emergence of new technologies such as web service, grid, this problem has become more complicated in service-...
165
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
161
click to vote
HM
2007
Springer
16 years 17 days ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
162
click to vote
ILP
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we focus on the problem of learning reactive skills for use by physical agents. We propose a new representation for such procedures, teleoreactive logic programs, al...