Results 1 - 10 of 301

A theoretical examination of practical game playing: Lookahead search

by Vahab Mirrokni, Nithum Thain, Adrian Vetta - In SAGT, M. Serna, Ed. Lecture Notes in Computer Science Series , 2012
"... Abstract. Lookahead search is perhaps the most natural and widely used game playing strategy. Given the practical importance of the method, the aim of this paper is to provide a theoretical performance examination of lookahead search in a wide variety of applications. To determine a strategy play us ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
the most appropriate choice of function will depend on the specifics of the actual game- we illustrate this in our examples. Furthermore, the type of search tree chosen by computationally-constrained agent can vary. We focus on the case where agents can evaluate only a bounded number, k, of moves

On the Implications of Lookahead Search in Game Playing

by Vahab Mirrokni, Nithum Thain, Adrian Vetta , 2012
"... Abstract. Lookahead search is perhaps the most natural and widely used game playing strategy. Given the practical importance of the method, the aim of this paper is to provide a theoretical performance examination of lookahead search in a wide variety of applications. To determine a strategy play us ..."
Abstract - Add to MetaCart
the most appropriate choice of function will depend on the specifics of the actual game- we illustrate this in our examples. Furthermore, the type of search tree chosen by computationally-constrained agent can vary. We focus on the case where agents can evaluate only a bounded number, k, of moves

Computationally Constrained Beliefs

by Drew Mcdermott , 2012
"... People and intelligent computers, if there ever are any, will both have to believe certain things in order to be intelligent agents at all, or to be a particular sort of intelligent agent. I distinguish implicit beliefs that are inherent in the architecture of a natural or artificial agent, in the w ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
People and intelligent computers, if there ever are any, will both have to believe certain things in order to be intelligent agents at all, or to be a particular sort of intelligent agent. I distinguish implicit beliefs that are inherent in the architecture of a natural or artificial agent

Emergence of collective behavior in evolving populations of flying agents

by Lee Spector, Jon Klein, Chris Perry, Mark Feinstein - in Genetic and Evolutionary Computation Conference (GECCO-2003 , 2003
"... Abstract. We demonstrate the emergence of collective behavior in two evolutionary computation systems, one an evolutionary extension of a classic (highly constrained) flocking algorithm and the other a relatively un-constrained system in which the behavior of agents is governed by evolved computer p ..."
Abstract - Cited by 65 (8 self) - Add to MetaCart
Abstract. We demonstrate the emergence of collective behavior in two evolutionary computation systems, one an evolutionary extension of a classic (highly constrained) flocking algorithm and the other a relatively un-constrained system in which the behavior of agents is governed by evolved computer

Transportable agents

by Keith D. Kotay, David Kotz - In Yannis Labrou and Tim Finin, editors, Proceedings of the CIKM Workshop on Intelligent Information Agents, Third International Conference on Information and Knowledge Management (CIKM 94 , 1994
"... As network information resources grow in size, it is often most efficient to process queries and updates at the site where the data is located. This processing can be accomplished by using a traditional client-server network interface, which constrains the client to the set of queries supported by t ..."
Abstract - Cited by 25 (4 self) - Add to MetaCart
by the server, or requires the server to send all data to the client for processing. The former is inflexible; the latter is inefficient. Transportable agents, which support the movement of the client computation to the location of the remote resource, have the potential to be more flexible and more efficient

Preventing Strategic Manipulation in Iterative Auctions: Proxy Agents and Price-Adjustment

by David C. Parkes, Lyle H. Ungar , 2000
"... Iterative auctions have many computational advantages over sealed-bid auctions, but can present new possibilities for strategic manipulation. We propose a two-stage technique to make iterative auctions that compute optimal allocations with myopic best-response bidding strategies more robust to manip ..."
Abstract - Cited by 63 (13 self) - Add to MetaCart
to manipulation. First, introduce proxy bidding agents to constrain bidding strategies to (possibly untruthful) myopic best-response. Second, after...

Multi-agent Coordination as Distributed Logic Programming

by David Robertson - In International Conference on Logic Programming , 2004
"... Abstract. A novel style of multi-agent system specification and deployment is described, in which familiar methods from computational logic are re-interpreted to a new context. One view of multi-agent system design is that coordination is achieved via an interaction model in which participating agen ..."
Abstract - Cited by 47 (10 self) - Add to MetaCart
Abstract. A novel style of multi-agent system specification and deployment is described, in which familiar methods from computational logic are re-interpreted to a new context. One view of multi-agent system design is that coordination is achieved via an interaction model in which participating

Matching Agents to Tasks in Networks

by Eduardo Camponogara, Sarosh N. Talukdar
"... ... this paper develops two models, which design the provisions to match the needs of each task, and frames the problems thereof as constrained bicriteria problems. Further, it analyzes the computational complexity of these matching problems and tests the merit in small but prototypical networks. ..."
Abstract - Add to MetaCart
... this paper develops two models, which design the provisions to match the needs of each task, and frames the problems thereof as constrained bicriteria problems. Further, it analyzes the computational complexity of these matching problems and tests the merit in small but prototypical networks.

Mobile agents for wireless computing: the convergence of wireless computational models with mobile-agent technologies

by Constantinos Spyrou, George Samaras - Mobile Networks and Applications , 2004
"... Abstract. Wireless mobile computing breaks the stationary barrier and allows users to compute and access information from anywhere and at anytime. However, this new freedom of movement does not come without new challenges. The mobile computing environment is constrained in many ways. Mobile elements ..."
Abstract - Cited by 32 (4 self) - Add to MetaCart
Abstract. Wireless mobile computing breaks the stationary barrier and allows users to compute and access information from anywhere and at anytime. However, this new freedom of movement does not come without new challenges. The mobile computing environment is constrained in many ways. Mobile

Approximation Techniques for Utilitarian Mechanism Design

by Patrick Briest, et al. , 2005
"... This paper deals with the design of efficiently computable incentive compatible, or truthful, mechanisms for combinatorial optimization problems with multi-parameter agents. We focus on approximation algorithms for NP-hard mechanism design problems. These algorithms need to satisfy certain monotonic ..."
Abstract - Cited by 92 (5 self) - Add to MetaCart
This paper deals with the design of efficiently computable incentive compatible, or truthful, mechanisms for combinatorial optimization problems with multi-parameter agents. We focus on approximation algorithms for NP-hard mechanism design problems. These algorithms need to satisfy certain
Results 1 - 10 of 301