1515 search results - page 179 / 303 » Prediction without markets |
147
Voted
WEA
2007
Springer
15 years 10 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
163
Voted
ISHPC
1999
Springer
15 years 8 months ago
1999
Springer
Superscalar microprocessor efficiency is generally not as high as anticipated. In fact, sustained utilization below thirty percent of peak is not uncommon, even for fully optimized...
142
click to vote
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
Telecommunication networks process verylarge numbers of events in real time. In this environment, database applications demand both high throughput (at reasonable costs), and pred...
168
click to vote
MICRO
1993
IEEE
15 years 8 months ago
1993
IEEE
Compile-time code transformations which expose instruction-level parallelism (ILP) typically take into account the constraints imposed by all execution scenarios in the program. H...
135
click to vote
CASES
2007
ACM
15 years 8 months ago
2007
ACM
Delayed branching is a technique to alleviate branch hazards without expensive hardware branch prediction mechanisms. For VLIW processors with deep pipelines and many issue slots,...