2313 search results - page 421 / 463 » On Heuristic Time Hierarchies |
182
click to vote
CLOUD
2010
ACM
15 years 11 months ago
2010
ACM
Over the last 10–15 years, our industry has developed and deployed many large-scale Internet services, from e-commerce to social networking sites, all facing common challenges i...
175
click to vote
CP
2001
Springer
15 years 10 months ago
2001
Springer
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
169
click to vote
ISPD
2000
ACM
15 years 10 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
174
click to vote
ANTS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
162
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...