Sciweavers

4524 search results - page 639 / 905
» The Complexity of Global Constraints
Sort
View
ATAL
2010
Springer
15 years 8 months ago
Opportunistic belief reconciliation during distributed interactions
Successful interaction between autonomous agents is contingent on those agents making decisions consistent with the expectations of their peers -- these expectations are based on ...
Paul Martin, David Robertson, Michael Rovatsos
ISSRE
2010
IEEE
15 years 5 months ago
Automata-Based Verification of Security Requirements of Composite Web Services
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
Hongyu Sun, Samik Basu, Vasant Honavar, Robyn R. L...
CORR
2011
Springer
159views Education» more  CORR 2011»
15 years 2 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
JLP
2011
155views more  JLP 2011»
15 years 2 months ago
QoS negotiation in service composition
Service composition in Service Oriented Computing concerns not only integration of heterogeneous distributed applications but also dynamic selection of services. Quality of Servic...
Maria Grazia Buscemi, Ugo Montanari
POPL
2011
ACM
14 years 10 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...