Sciweavers

568 search results - page 68 / 114
» The Great Language Debate
Sort
View
ICALP
2007
Springer
15 years 3 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis
CIA
2006
Springer
15 years 3 months ago
Conversation-Based Specification and Composition of Agent Services
There is great promise in the idea of having agent or web services available on the internet, that can be flexibly composed to achieve more complex services, which can themselves t...
Quoc Bao Vo, Lin Padgham
AISC
2008
Springer
15 years 1 months ago
Case Studies in Model Manipulation for Scientific Computing
Abstract. The same methodology is used to develop 3 different applications. We begin by using a very expressive, appropriate Domain Specific Language, to write down precise problem...
Jacques Carette, Spencer Smith, John McCutchan, Ch...
ASPLOS
2008
ACM
15 years 1 months ago
SoftSig: software-exposed hardware signatures for code analysis and optimization
Many code analysis techniques for optimization, debugging, or parallelization need to perform runtime disambiguation of sets of addresses. Such operations can be supported efficie...
James Tuck, Wonsun Ahn, Luis Ceze, Josep Torrellas
CC
2008
Springer
124views System Software» more  CC 2008»
15 years 1 months ago
Coqa: Concurrent Objects with Quantized Atomicity
This paper introduces a new language model, Coqa, for deeply embedding concurrent programming into objects. Every program written in our language has the desirable behaviors of ato...
Yu David Liu, Xiaoqi Lu, Scott F. Smith