343 search results - page 4 / 69 » Purely Relational FLWORs |
WAOA
2005
Springer
14 years 28 days ago
2005
Springer
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
HVEI
2010
13 years 9 months ago
2010
The overall image quality benefits substantially from good reproduction of black tones. Modern displays feature relatively low black level, making them capable rendering good dark...
POPL
2003
ACM
14 years 7 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
ECAI
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Learning in complex contexts often requires pure induction to be supported by various kinds of meta-information. Providing such information is a critical, difficult and ...