Sciweavers

6300 search results - page 1065 / 1260
» We have it easy, but do we have it right
Sort
View
EWSN
2010
Springer
15 years 10 months ago
Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature...
Marco Zuniga, Chen Avin, Manfred Hauswirth
ESWS
2009
Springer
15 years 8 months ago
The Relevance of Reasoning and Alignment Incoherence in Ontology Matching
Abstract. Ontology matching has become an important field of research over the last years. Although many different approaches have been proposed, only few of them are committed t...
Christian Meilicke
VMCAI
2007
Springer
15 years 7 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
DFT
2006
IEEE
130views VLSI» more  DFT 2006»
15 years 7 months ago
Off-Chip Control Flow Checking of On-Chip Processor-Cache Instruction Stream
Control flow checking (CFC) is a well known concurrent checking technique for ensuring that a program’s instruction execution sequence follows permissible paths. Almost all CFC...
Federico Rota, Shantanu Dutt, Sahithi Krishna
ICPP
2005
IEEE
15 years 7 months ago
A Hybrid Searching Scheme in Unstructured P2P Networks
The existing searching schemes in Peer-to-Peer (P2P) networks are either forwarding-based or non-forwarding based. In forwarding-based schemes, queries are forwarded from the quer...
Xiuqi Li, Jie Wu
« Prev « First page 1065 / 1260 Last » Next »