Sciweavers

1263 search results - page 122 / 253
» A* with Bounded Costs
Sort
View
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
14 years 3 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
SPAA
2004
ACM
14 years 3 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
PLDI
2010
ACM
14 years 2 months ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
IJVR
2008
106views more  IJVR 2008»
13 years 9 months ago
Improved View Frustum Culling Technique for Real-Time Virtual Heritage Application
Real-time virtual heritage application is normally executed with a high performance computer system. This is due to the complexity and highly computational cost which makes such sy...
Mohd Shahrizal Sunar, Abdullah Mohd Zin, Tengku M....
DAC
2008
ACM
14 years 10 months ago
Symbolic noise analysis approach to computational hardware optimization
This paper addresses the problem of computational error modeling and analysis. Choosing different word-lengths for each functional unit in hardware implementations of numerical al...
Arash Ahmadi, Mark Zwolinski