Sciweavers

1941 search results - page 218 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
HPCC
2007
Springer
15 years 10 months ago
A New Method for Multi-objective TDMA Scheduling in Wireless Sensor Networks Using Pareto-Based PSO and Fuzzy Comprehensive Judg
In wireless sensor networks with many-to-one transmission mode, a multi-objective TDMA (Time Division Multiple Access) scheduling model is presented, which concerns about the packe...
Tao Wang, Zhiming Wu, Jianlin Mao
JDCTA
2010
176views more  JDCTA 2010»
15 years 1 months ago
A Context-Aware Framework using Ontology for Smart Phone Platform
Context-awareness has been considered as promising topic in pervasive computing area, but a review of the existing approaches shown that developing diverse application services in...
Yun Her, Su-Kyoung Kim, YoungTaek Jin
POPL
2009
ACM
16 years 7 months ago
Proving that non-blocking algorithms don't block
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
CADE
2006
Springer
16 years 6 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman
PLILP
1992
Springer
15 years 10 months ago
Unfold/fold Transformations Preserving Termination Properties
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
Torben Amtoft