Sciweavers

344 search results - page 33 / 69
» Some Theorems We Should Prove
Sort
View
WOODPECKER
2001
13 years 8 months ago
Consistency Checking of RM-ODP Specifications
Ensuring that specifications are consistent is an important part of specification development and testing. In this paper we introduce the ConsVISor tool for consistency checking o...
Kenneth Baclawski, Mieczyslaw M. Kokar, Jeffrey E....
DAGSTUHL
2000
13 years 8 months ago
Product Form Queueing Networks
Queueing network models have been extensively applied to represent and analyze resource sharing systems such as communication and computer systems and they have proved to be a pow...
Simonetta Balsamo
GLOBECOM
2007
IEEE
14 years 1 months ago
Power-Modulated Challenge-Response Schemes for Verifying Location Claims
—Location information should be verifiable in order to support new computing and information services. In this paper, we adapt the classical challenge-response method for authen...
Yu Zhang, Zang Li, Wade Trappe
FOSSACS
2006
Springer
13 years 11 months ago
Presenting Functors by Operations and Equations
We take the point of view that, if transition systems are coalgebras for a functor T, then an adequate logic for these transition systems should arise from the `Stone dual' L ...
Marcello M. Bonsangue, Alexander Kurz
OL
2011
277views Neural Networks» more  OL 2011»
13 years 2 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...