14548 search results - page 255 / 2910 » The Optimal Path-Matching Problem |
97
Voted
IOR
2007
15 years 2 months ago
2007
We consider a scenario in which a single Red wishes to shoot at a collection of Blue targets, one at a time, to maximise some measure of return obtained from Blues killed before R...
IWANN
2005
Springer
15 years 8 months ago
2005
Springer
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
109
click to vote
SAC
1996
ACM
15 years 6 months ago
1996
ACM
The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is k...
119
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper considers the problem of lter design with secrecy constraints, where two legitimate parties (Alice and Bob) communicate in the presence of an eavesdropper (Eve), over a...
221
click to vote
AUSSOIS
2001
Springer
15 years 7 months ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...