Sciweavers

328 search results - page 31 / 66
» Simple Termination Revisited
Sort
View
STOC
2003
ACM
137views Algorithms» more  STOC 2003»
14 years 8 months ago
Near-optimal network design with selfish agents
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
Elliot Anshelevich, Anirban Dasgupta, Éva T...
CADE
2009
Springer
14 years 8 months ago
Complexity of Fractran and Productivity
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
Clemens Grabmayer, Dimitri Hendriks, Jörg End...
INFOCOM
2010
IEEE
13 years 6 months ago
Topological Properties Affect the Power of Network Coding in Decentralized Broadcast
—There exists a certain level of ambiguity regarding whether network coding can further improve download performance in P2P content distribution systems, as compared to commonly ...
Di Niu, Baochun Li
UIST
2009
ACM
14 years 2 months ago
Changing how people view changes on the web
The Web is a dynamic information environment. Web content changes regularly and people revisit Web pages frequently. But the tools used to access the Web, including browsers and s...
Jaime Teevan, Susan T. Dumais, Daniel J. Liebling,...
LOPSTR
2009
Springer
14 years 2 months ago
LP with Flexible Grouping and Aggregates Using Modes
We propose a new grouping operator for logic programs based on the group_by operator of SQL. The novelty of our proposal lies in the use of modes, which allows us to relax some rat...
Marcin Czenko, Sandro Etalle