Sciweavers

3359 search results - page 573 / 672
» A Simplified Idea Algorithm
Sort
View
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
13 years 7 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
INFOCOM
2010
IEEE
13 years 7 months ago
Efficient Continuous Scanning in RFID Systems
RFID is an emerging technology with many potential applications such as inventory management for supply chain. In practice, these applications often need a series of continuous sca...
Bo Sheng, Qun Li, Weizhen Mao
PDPTA
2010
13 years 7 months ago
Data-Parallelism and GPUs for Lattice Gas Fluid Simulations
Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns aro...
Mitchel Johnson, Daniel P. Playne, Kenneth A. Hawi...
SENSYS
2010
ACM
13 years 7 months ago
Locating sensors in the wild: pursuit of ranging quality
Localization is a fundamental issue of wireless sensor networks that has been extensively studied in the literature. The real-world experience from GreenOrbs, a sensor network sys...
Wei Xi, Yuan He, Yunhao Liu, Jizhong Zhao, Lufeng ...
WCET
2010
13 years 7 months ago
A Code Policy Guaranteeing Fully Automated Path Analysis
Calculating the worst-case execution time (WCET) of real-time tasks is still a tedious job. Programmers are required to provide additional information on the program flow, analyzi...
Benedikt Huber, Peter P. Puschner