Sciweavers

60 search results - page 7 / 12
» General theory of information transfer: Updated
Sort
View
POPL
2004
ACM
14 years 7 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
MOBIHOC
2006
ACM
14 years 7 months ago
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
Pablo Soldati, Björn Johansson, Mikael Johans...
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 9 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
ATAL
2011
Springer
12 years 7 months ago
Incentive design for adaptive agents
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
Yiling Chen, Jerry Kung, David C. Parkes, Ariel D....
CHI
2007
ACM
13 years 11 months ago
An exploration of web-based monitoring: implications for design
Monitoring occurs when users return to previously viewed web pages to view new or updated information. While tools exist to support web-based monitoring, we know little about the ...
Melanie Kellar, Carolyn R. Watters, Kori M. Inkpen