Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
Many applications in ubiquitous computing rely on knowing where people and objects are relative to each other. By placing small wireless sensors on people, at specific locations, ...
Waylon Brunette, Carl Hartung, Ben Nordstrom, Gaet...
Abstract--We investigate an abstraction method, called meanfield method, for the performance evaluation of dynamic networks with pairwise communication between nodes. It allows us ...
Mobile applications are becoming increasingly ubiquitous and provide ever richer functionality on mobile devices. At the same time, such devices often enjoy strong connectivity wi...
Real-time embedded systems increasingly rely on dynamic power management to balance between power and performance goals. In this paper, we present a technique for continuous frequ...