5314 search results - page 148 / 1063 » Hybrid Dynamic Programming |
114
Voted
ICPR
2002
IEEE
16 years 3 months ago
2002
IEEE
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...
128
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
119
Voted
AINA
2009
IEEE
15 years 9 months ago
2009
IEEE
— Reprogramming node software over-the-air is an essential requirement in many wireless sensor network applications due to the inaccessibility of the deployed sensor nodes. Trans...
124
Voted
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—The routing problem in Wireless Mesh Networks is concerned with finding “good” source-destination paths. It generally faces multiple objectives to be optimized, such as i) ...
126
Voted
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...