In this talk, we discuss three problems. The first is on an asynchronous multi-antenna wireless communication system and the later two are on collaborative estimation.
A centralized dynamic, opportunistic scheduling decision has to be made by a Base station (BS) to fair share the resources, based on the current channel gains signaled by the mobiles.
This will be a talk on the proof of NP hardness of the Art Gallery Problem (which was described by Pritam last week). Approximation algorithms for the terrain guarding problem will also be described.
Logic (first order or temporal) can be easily extended to describe counts, parity and other numerical phenomena. The satisfiability problem of the extended logic is easily seen to be undecidable, even on models which are finite words.
