12950 search results - page 457 / 2590 » On Optimal Timed Strategies |
160
click to vote
ESA
2007
Springer
16 years 1 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
177
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
208
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
189
click to vote
ICMCS
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper, we discuss the cache replacement policy in a multimedia transcoding proxy. Unlike the cache replacement for conventional web objects, to replace some elements with ...
187
click to vote
ASPDAC
2006
ACM
16 years 1 months ago
2006
ACM
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...