612 search results - page 85 / 123 » Hardness assumptions in the foundations of theoretical compu... |
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
FOCS
2002
IEEE
14 years 21 days ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
GIS
2004
ACM
14 years 8 months ago
2004
ACM
This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the ...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...