Sciweavers

1224 search results - page 226 / 245
» Theory decision by decomposition
Sort
View
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 9 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
WWW
2007
ACM
14 years 11 months ago
Speeding up adaptation of web service compositions using expiration times
Web processes must often operate in volatile environments where the quality of service parameters of the participating service providers change during the life time of the process...
John Harney, Prashant Doshi
WWW
2007
ACM
14 years 11 months ago
Preference-based selection of highly configurable web services
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...
Steffen Lamparter, Anupriya Ankolekar, Rudi Studer...
WWW
2002
ACM
14 years 11 months ago
Simulation, verification and automated composition of web services
Web services -- Web-accessible programs and devices ? are a key application area for the Semantic Web. With the proliferation of Web services and the evolution towards the Semanti...
Srini Narayanan, Sheila A. McIlraith
ICFP
2009
ACM
14 years 11 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...