Sciweavers

999 search results - page 61 / 200
» Constraints in Non-Boolean Contexts
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Making the Case for Random Access Scheduling in Wireless Multi-hop Networks
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
Apoorva Jindal, Ann Arbor, Konstantinos Psounis
LPAR
2010
Springer
15 years 4 months ago
On the Complexity of Model Expansion
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
Antonina Kolokolova, Yongmei Liu, David G. Mitchel...
SYNTHESE
2010
129views more  SYNTHESE 2010»
15 years 4 months ago
Belief and contextual acceptance
I develop a strategy for representing epistemic states and epistemic changes that seeks to be sensitive to the difference between voluntary and involuntary aspects of our epistemi...
Eleonora Cresto
SOCA
2010
IEEE
15 years 4 months ago
Supporting the evolution of model-driven service-oriented systems: A case study on QoS-aware process-driven SOAs
Process-driven service-oriented architectures (SOA) need to cope with constant changing requirements of various compliance requirements, such as quality of service (QoS) constraint...
Ernst Oberortner, Uwe Zdun, Schahram Dustdar, Agni...
CORR
2011
Springer
177views Education» more  CORR 2011»
15 years 1 months ago
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
Shaddin Dughmi