Algorithms and mechanisms for procuring services with uncertain durations using redundancy
暂无分享,去创建一个
Nicholas R. Jennings | Alex Rogers | Sebastian Stein | Enrico Gerding | Kate Larson | K. Larson | A. Rogers | N. Jennings | S. Stein | E. Gerding
[1] J. Christopher Beck,et al. Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations , 2011, J. Artif. Intell. Res..
[2] Nicholas R. Jennings,et al. Mechanism design for the truthful elicitation of costly probabilistic estimates in distributed information systems , 2011, Artif. Intell..
[3] Munindar P. Singh,et al. From Quality to Utility: Adaptive Service Selection Framework , 2010, ICSOC.
[4] Nicholas R. Jennings,et al. Optimal Task Migration in Service-Oriented Systems: Algorithms and Mechanisms , 2010, ECAI.
[5] Dafna Shahaf,et al. Generalized Task Markets for Human and Machine Computation , 2010, AAAI.
[6] Nicholas R. Jennings,et al. Scalable mechanism design for the procurement of services with uncertain durations , 2010, AAMAS.
[7] Prashant Pandey,et al. Cloud computing , 2010, ICWET.
[8] Nicholas R. Jennings,et al. Flexible Procurement of Services with Uncertain Durations using Redundancy , 2009, IJCAI.
[9] Sebastian Stein,et al. Flexible selection of heterogeneous and unreliable services in large-scale grids , 2009, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.
[10] Yoav Shoham,et al. Empirical hardness models: Methodology and a case study on combinatorial auctions , 2009, JACM.
[11] Nicholas R. Jennings,et al. Mechanism design for task procurement with flexible quality of service , 2009, AAMAS.
[12] Sarvapali D. Ramchurn,et al. Trust-Based Mechanisms for Robust and Efficient Task Allocation in the Presence of Execution Uncertainty , 2009, J. Artif. Intell. Res..
[13] Noam Nisan,et al. Two simplified proofs for Roberts’ theorem , 2009, Soc. Choice Welf..
[14] Yingqian Zhang,et al. Computing the fault tolerance of multi-agent deployment , 2009, Artif. Intell..
[15] Zizhuo Wang,et al. A unified framework for dynamic pari-mutuel information market design , 2009, EC '09.
[16] Y. Narahari,et al. Game Theoretic Problems in Network Economics and Mechanism Design Solutions , 2009, Advanced Information and Knowledge Processing.
[17] Rajkumar Buyya,et al. A Meta-scheduler with Auction Based Resource Allocation for Global Grids , 2008, 2008 14th IEEE International Conference on Parallel and Distributed Systems.
[18] Moshe Tennenholtz,et al. Fault tolerant mechanism design , 2008, Artif. Intell..
[19] Milind Tambe,et al. Towards Faster Planning with Continuous Resources in Stochastic Domains , 2008, AAAI.
[20] Edmund H. Durfee,et al. Commitment-based service coordination , 2008, Int. J. Agent Oriented Softw. Eng..
[21] T. Payne,et al. Flexible service provisioning with advance agreements , 2008, AAMAS.
[22] Tristan Glatard,et al. Optimizing jobs timeouts on clusters and production grids , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).
[23] José Niño-Mora,et al. Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract) , 2007, Electron. Notes Discret. Math..
[24] Abdelkarim Erradi,et al. Recovery Policies for Enhancing Web Services Reliability , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).
[25] Edward A. Lee,et al. CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE Concurrency Computat.: Pract. Exper. 2000; 00:1–7 Prepared using cpeauth.cls [Version: 2002/09/19 v2.02] Taverna: Lessons in creating , 2022 .
[26] Moshe Babaioff,et al. Combinatorial agency , 2006, EC '06.
[27] Nicholas R. Jennings,et al. TRAVOS: Trust and Reputation in the Context of Inaccurate Information Sources , 2006, Autonomous Agents and Multi-Agent Systems.
[28] Lihong Li,et al. Lazy Approximation for Solving Continuous Finite-Horizon MDPs , 2005, AAAI.
[29] Thomas Friese,et al. Self-healing Execution of Business Processes Based on a Peer-to-Peer Service Architecture , 2005, ARCS.
[30] Stephen Morris,et al. Ex Post Implementation , 2005, Games Econ. Behav..
[31] David Abramson,et al. The Grid Economy , 2005, Proceedings of the IEEE.
[32] Kousha Etessami,et al. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations , 2005, JACM.
[33] Sanjay Ghemawat,et al. MapReduce: simplified data processing on large clusters , 2008, CACM.
[34] Sarvapali D. Ramchurn,et al. Trust in multi-agent systems , 2004, The Knowledge Engineering Review.
[35] Michael N. Huhns,et al. Robust software via agent-based redundancy , 2003, AAMAS '03.
[36] David P. Anderson,et al. SETI@home: an experiment in public-resource computing , 2002, CACM.
[37] Xiao Qin,et al. An efficient fault-tolerant scheduling algorithm for real-time tasks with precedence constraints in heterogeneous systems , 2002, Proceedings International Conference on Parallel Processing.
[38] Eric Horvitz,et al. Dynamic restart policies , 2002, AAAI/IAAI.
[39] Ehud Rivlin,et al. Optimal schedules for parallelizing anytime algorithms: the case of independent processes , 2002, AAAI/IAAI.
[40] B. Moldovanu,et al. Efficient Design with Interdependent Valuations , 2001 .
[41] Ian T. Foster,et al. The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.
[42] Bart Selman,et al. Algorithm portfolios , 2001, Artif. Intell..
[43] Noam Nisan,et al. Computationally feasible VCG mechanisms , 2000, EC '00.
[44] Bernardo A. Huberman,et al. A methodology for managing risk in electronic transactions over the Internet , 2000 .
[45] John N. Tsitsiklis,et al. The Complexity of Optimal Queuing Network Control , 1999, Math. Oper. Res..
[46] Somesh Jha,et al. Query restart strategies for Web agents , 1998, AGENTS '98.
[47] Tad Hogg,et al. An Economics Approach to Hard Computational Problems , 1997, Science.
[48] David W. Coit,et al. Reliability optimization of series-parallel systems using a genetic algorithm , 1996, IEEE Trans. Reliab..
[49] Yingfeng Oh,et al. Scheduling real-time tasks for dependability , 1995 .
[50] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[51] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[52] Kishor S. Trivedi. Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .
[53] M. Weitzman. Optimal search for the best alternative , 1978 .
[54] C. Hwang,et al. Optimization Techniques for System Reliability with RedundancyߞA Review , 1977, IEEE Transactions on Reliability.
[55] Y. Narahari,et al. Mechanism Design for Resource Procurement in Grid Computing , 2009 .
[56] E. Maasland,et al. Auction Theory , 2021, Springer Texts in Business and Economics.
[57] Munindar P. Singh,et al. Service-Oriented Computing: Semantics, Processes, Agents , 2010 .
[58] Sarvapali D. Ramchurn,et al. Trust in Multiagent Systems , 2004 .
[59] Santosh K. Shrivastava,et al. Advances in Distributed Systems , 2002, Lecture Notes in Computer Science.
[60] Santosh K. Shrivastava,et al. Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems , 1999 .
[61] A. Mas-Colell,et al. Microeconomic Theory , 1995 .
[62] P. Whittle. Restless bandits: activity allocation in a changing world , 1988, Journal of Applied Probability.
[63] J. Gittins. Bandit processes and dynamic allocation indices , 1979 .
[64] Nils J. Nilsson,et al. Artificial Intelligence , 1974, IFIP Congress.