Sciweavers

835 search results - page 85 / 167
» Scheduling to maximize participation
Sort
View
ACMICEC
2006
ACM
111views ECommerce» more  ACMICEC 2006»
15 years 10 months ago
Passive verification of the strategyproofness of mechanisms in open environments
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyp...
Laura Kang, David C. Parkes
JSAC
2006
99views more  JSAC 2006»
15 years 6 months ago
Incentives for large peer-to-peer systems
We consider problems of provisioning an excludable public good amongst n potential members of a peer-to-peer system who are able to communicate information about their private pre...
Costas Courcoubetis, Richard R. Weber
ICDCSW
2002
IEEE
15 years 11 months ago
Trust-Aware Cooperation
In mobile teamwork environments two basic problems exist: how to discover someone based on a profile (skills, reputations) and how to assess that person’s “credibility” (tr...
Zoran Despotovic, Karl Aberer, Manfred Hauswirth
HPDC
1999
IEEE
15 years 10 months ago
Remote Application Scheduling on Metacomputing Systems
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
Heath A. James, Kenneth A. Hawick
ICDE
2003
IEEE
73views Database» more  ICDE 2003»
16 years 7 months ago
Scalable Application-Aware Data Freshening
Distributed databases and other networked information systems use copies or mirrors to reduce latency and to increase availability. Copies need to be refreshed. In a loosely coupl...
Donald Carney, Sangdon Lee, Stanley B. Zdonik