Sciweavers

724 search results - page 112 / 145
» Discrete Rate Simulation using linear programming
Sort
View
84
Voted
IPPS
2000
IEEE
15 years 2 months ago
Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...
Leonid Oliker, Xiaoye S. Li, Gerd Heber, Rupak Bis...
104
Voted
JCSS
2000
116views more  JCSS 2000»
14 years 9 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
IFIP
2004
Springer
15 years 3 months ago
High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens
69
Voted
SIGGRAPH
1999
ACM
15 years 2 months ago
Optimization of Mesh Locality for Transparent Vertex Caching
Bus traffic between the graphics subsystem and memory can become a bottleneck when rendering geometrically complex meshes. In this paper, we investigate the use of vertex caching...
Hugues Hoppe
AAAI
2006
14 years 11 months ago
Properties of Forward Pruning in Game-Tree Search
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...
Yew Jin Lim, Wee Sun Lee