Sciweavers

2313 search results - page 349 / 463
» On Heuristic Time Hierarchies
Sort
View
CLUSTER
2008
IEEE
16 years 27 days ago
Empirical-based probabilistic upper bounds for urgent computing applications
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
Nick Trebon, Peter H. Beckman
DATE
2008
IEEE
78views Hardware» more  DATE 2008»
16 years 27 days ago
Simultaneous FU and Register Binding Based on Network Flow Method
– With the rapid increase of design complexity and the decrease of device features in nano-scale technologies, interconnection optimization in digital systems becomes more and mo...
Jason Cong, Junjuan Xu
HASE
2008
IEEE
16 years 26 days ago
Small Logs for Transactional Services: Distinction is Much More Accurate than (Positive) Discrimination
For complex services, logging is an integral part of many middleware aspects, especially, transactions and monitoring. In the event of a failure, the log allows us to deduce the c...
Debmalya Biswas, Thomas Gazagnaire, Blaise Genest
ICPP
2008
IEEE
16 years 26 days ago
Scalable Techniques for Transparent Privatization in Software Transactional Memory
—We address the recently recognized privatization problem in software transactional memory (STM) runtimes, and introduce the notion of partially visible reads (PVRs) to heuristic...
Virendra J. Marathe, Michael F. Spear, Michael L. ...
ICPR
2008
IEEE
16 years 26 days ago
Topologically correct surface reconstruction using alpha shapes and relations to ball-pivoting
The problem to reconstruct a surface given a finite set of boundary points is of growing interest, e.g. in the context of laser range images. While a lot of heuristic methods hav...
Peer Stelldinger