2473 search results - page 166 / 495 » The Logic of Communication Graphs |
136
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
131
click to vote
AMAST
2008
Springer
15 years 5 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
114
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
126
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Many sensor network applications are tightly coupled with the geometric environment where the sensor nodes are deployed. The topological skeleton extraction has shown gr...
122
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...