Sciweavers

858 search results - page 125 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
AAAI
2006
13 years 9 months ago
Decision Making in Uncertain Real-World Domains Using DT-Golog
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decisi...
Mikhail Soutchanski, Huy Pham, John Mylopoulos
17
Voted
NOMS
2008
IEEE
14 years 2 months ago
Utility-based placement of dynamic Web applications with fairness goals
Abstract—We study the problem of dynamic resource allocation to clustered Web applications. We extend application server middleware with the ability to automatically decide the s...
David Carrera, Malgorzata Steinder, Ian Whalley, J...
TII
2008
169views more  TII 2008»
13 years 7 months ago
Fine-Tuning MAC-Level Protocols for Optimized Real-Time QoS
In distributed real-time systems, meeting the real-time constraints is mandatory but the satisfaction of other application-dependent criteria is most generally required as well. I...
Mathieu Grenier, Nicolas Navet
RE
2010
Springer
13 years 2 months ago
Fuzzy Goals for Requirements-Driven Adaptation
Self-adaptation is imposing as a key characteristic of many modern software systems to tackle their complexity and cope with the many environments in which they can operate. Self-a...
Luciano Baresi, Liliana Pasquale, Paola Spoletini
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
14 years 8 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...