12950 search results - page 190 / 2590 » On Optimal Timed Strategies |
130
click to vote
COMPSAC
2004
IEEE
15 years 8 months ago
2004
IEEE
Time/utility function time constraints (or TUFs) and utility accrual (UA) scheduling optimality criteria, constitute, arguably, the most effective and broadest approach for adapti...
125
click to vote
AAAI
1996
15 years 5 months ago
1996
We formalize a model for supervised learning of action strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. W...
117
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
—This paper introduces a novel deployment time optimization technology for Internet services. Using the configuration information collected from the operation environment, the pr...
136
click to vote
FMSD
2008
15 years 4 months ago
2008
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
160
click to vote
CASES
2003
ACM
15 years 9 months ago
2003
ACM
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...