1671 search results - page 221 / 335 » Language Constructs for Multi-agent Programming |
171
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
165
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
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...
252
click to vote
PPOPP
2011
ACM
14 years 9 months ago
2011
ACM
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
145
click to vote
OOPSLA
2004
Springer
15 years 11 months ago
2004
Springer
In an object-oriented language, a derived class may declare a method with the same signature as a method in the base class. The meaning of the re-declaration depends on the langua...
283
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...