1972 search results - page 171 / 395 » Evolutionary algorithms and dynamic programming |
108
click to vote
INFOCOM
1991
IEEE
15 years 6 months ago
1991
IEEE
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuri...
114
click to vote
ISSTA
2009
ACM
15 years 9 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
167
click to vote
CVPR
2011
IEEE
15 years 2 days ago
2011
IEEE
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
175
click to vote
IPL
2006
15 years 2 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
128
click to vote
AGTIVE
2003
Springer
15 years 7 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...