1927 search results - page 139 / 386 » UMDAs for dynamic optimization problems |
111
Voted
ISLPED
1999
ACM
15 years 5 months ago
1999
ACM
-- The goal of a dynamic power management policy is to reduce the power consumption of an electronic system by putting system components into different states, each representing ce...
116
Voted
INFOCOM
1999
IEEE
15 years 5 months ago
1999
IEEE
We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which reso...
125
Voted
CPAIOR
2008
Springer
15 years 2 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
118
click to vote
IJCAI
2007
15 years 2 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
123
Voted
CPM
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...