Sciweavers

1864 search results - page 52 / 373
» Formal topology and domains
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
14 years 2 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
CGI
1998
IEEE
14 years 2 months ago
A Data Dependent Triangulation for Vector Fields
This article deals with dependencies of a piecewise linear vector field and the triangulation of the domain. It shows that the topology of the field may depend on the triangulatio...
Gerik Scheuermann, Hans Hagen
ICDCS
2010
IEEE
13 years 12 months ago
Distributed Coverage in Wireless Ad Hoc and Sensor Networks by Topological Graph Approaches
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
Dezun Dong, Yunhao Liu, Kebin Liu, Xiangke Liao
BMCBI
2006
112views more  BMCBI 2006»
13 years 10 months ago
Algorithms for incorporating prior topological information in HMMs: application to transmembrane proteins
Background: Hidden Markov Models (HMMs) have been extensively used in computational molecular biology, for modelling protein and nucleic acid sequences. In many applications, such...
Pantelis G. Bagos, Theodore D. Liakopoulos, Stavro...
MOBIHOC
2007
ACM
14 years 9 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi