1391 search results - page 197 / 279 » Complexity Limitations on Quantum Computation |
130
Voted
ICCS
2005
Springer
15 years 9 months ago
2005
Springer
Computational Grids potentially offer cheap large-scale high-performance systems, but are a very challenging architecture, being heterogeneous, shared and hierarchical. Rather tha...
145
click to vote
ACG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
115
Voted
ICNS
2007
IEEE
15 years 10 months ago
2007
IEEE
— Short flow first scheduling (SFF) strategy is effective in obtaining more stringent performance bounds for short flows in Internet. However, previous strict SFF approaches i...
160
Voted
ICS
2007
Tsinghua U.
15 years 10 months ago
2007
Tsinghua U.
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...
132
Voted
VISUALIZATION
2005
IEEE
15 years 9 months ago
2005
IEEE
Understanding and analyzing complex volumetrically varying data is a difficult problem. Many computational visualization techniques have had only limited success in succinctly po...