2926 search results - page 544 / 586 » Partially Optimal Routing |
143
click to vote
ASPLOS
1996
ACM
15 years 4 months ago
1996
ACM
Branch prediction is an important mechanism in modern microprocessor design. The focus of research in this area has been on designing new branch prediction schemes. In contrast, v...
88
Voted
VLDB
1997
ACM
15 years 4 months ago
1997
ACM
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...
119
Voted
CAV
2010
Springer
15 years 4 months ago
2010
Springer
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
109
Voted
CODES
2004
IEEE
15 years 4 months ago
2004
IEEE
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
129
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) that can automatically acquire, evolve and re-use partial solutions in the for...