Sciweavers

1743 search results - page 227 / 349
» Generalized Modal Satisfiability
Sort
View
128
Voted
FOCS
2009
IEEE
15 years 11 months ago
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
Daniel Gottesman, Sandy Irani
ICAC
2009
IEEE
15 years 11 months ago
Applying adaptation design patterns
Dynamic adaptation may be used to prevent software downtime while new requirements and responses to environmental conditions are incorporated into the system. Previously, we studi...
Andres J. Ramirez, Betty H. C. Cheng
RTCSA
2009
IEEE
15 years 11 months ago
Event-Based Location Dependent Data Services in Mobile WSNs
—Mobile sensors are widely deployed in Wireless Sensor Networks (WSNs) to satisfy emerging application requirements. Specifically, processing location dependent queries in mobile...
Liang Hong, Yafeng Wu, Sang Hyuk Son, Yansheng Lu
130
Voted
ESA
2009
Springer
111views Algorithms» more  ESA 2009»
15 years 11 months ago
Exact and Approximate Equilibria for Optimal Group Network Formation
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
Elliot Anshelevich, Bugra Caskurlu
LPNMR
2009
Springer
15 years 11 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas