Results 11 - 20 of 1,470

The Prize Collecting Steiner Tree Problem

by Maria Minkoff , 2000
"... This work is motivated by an application in local access network design that can be modeled using the NP-hard Prize Collecting Steiner Tree problem. We consider several variants on this problem and on the primal-dual 2-approximation algorithm devised for it by Goemans and Williamson. We develop seve ..."
Abstract - Cited by 103 (1 self) - Add to MetaCart
This work is motivated by an application in local access network design that can be modeled using the NP-hard Prize Collecting Steiner Tree problem. We consider several variants on this problem and on the primal-dual 2-approximation algorithm devised for it by Goemans and Williamson. We develop

A Tuning Machine for Collective Commitments

by Barbara Dunin-Keplicz, Rineke Verbrugge - Proceedings of Formal Approaches to Multi-Agent Systems (FAMAS 2003 , 2003
"... In this paper we aim to formally model individual, social and collective motivational attitudes in teams of agents involved in Cooperative Problem Solving. Particular attention is given to the strongest motivational attitude, collective commitment, which leads to team action. ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
In this paper we aim to formally model individual, social and collective motivational attitudes in teams of agents involved in Cooperative Problem Solving. Particular attention is given to the strongest motivational attitude, collective commitment, which leads to team action.

Collective Intentions

by Barbara Dunin-Keplicz, Rineke Verbrugge , 2002
"... In this paper the notion of collective intention in teams of agents involved in cooperative problem solving (CPS) in multiagent systems (MAS) is investigated. Starting from individual intentions, goals,andbeliefs defining agents' local asocial motivational and informational attitudes, we ar ..."
Abstract - Cited by 29 (8 self) - Add to MetaCart
In this paper the notion of collective intention in teams of agents involved in cooperative problem solving (CPS) in multiagent systems (MAS) is investigated. Starting from individual intentions, goals,andbeliefs defining agents' local asocial motivational and informational attitudes, we

A Retrospective View of FA/C Distributed Problem Solving

by Victor R. Lesser , 1991
"... The Functionally-Accurate, Cooperative (FA/C) paradigm provides a model for task decomposition and agent interaction in a distributed problem-solving system. In this model, agents need not have all the necessary information locally to solve their subproblems, and agents interact through the asynchro ..."
Abstract - Cited by 105 (27 self) - Add to MetaCart
The Functionally-Accurate, Cooperative (FA/C) paradigm provides a model for task decomposition and agent interaction in a distributed problem-solving system. In this model, agents need not have all the necessary information locally to solve their subproblems, and agents interact through

Collective-Movement Teams for Cooperative Problem Solving

by Ro Rodríguez, James A. Reggia , 2004
"... Self-organizing particle systems (“swarms”) consist of numerous autonomous, re-flexive agents (“particles”) whose collective movements through space are determined primarily by local influences. Such systems have been traditionally used to simulate groups of animals and other biological phenomena. T ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
that agents are able to not only effectively solve the assigned problems, but that they do so in a more efficient manner than similar but independently moving agents. Further, collectively moving agents display coordination emerging purely from their local interactions and use this cooperation as a clear

Evolution of Collective Commitment during Teamwork

by Barbara Dunin-Keplicz, Rineke Verbrugge , 2003
"... In this paper we aim to describe dynamic aspects of social and collective attitudes in teams of agents involved in Cooperative Problem Solving (CPS). Particular attention is given to the strongest motivational attitude, collective commitment, and its evolution during team action. First, building ..."
Abstract - Cited by 18 (3 self) - Add to MetaCart
In this paper we aim to describe dynamic aspects of social and collective attitudes in teams of agents involved in Cooperative Problem Solving (CPS). Particular attention is given to the strongest motivational attitude, collective commitment, and its evolution during team action. First, building

Motivating Cooperation on Peer to Peer Networks

by Helen Bretzke, Julita Vassileva - Proceedings User Modeling UM03 , 2003
"... Abstract. This paper addresses the problem of free riding on peer-to-peer resource-sharing networks and explores methods for motivating more cooperative user behaviour via an adaptive interface. The paper argues that the free-riding problem is not so much an economic issue as a socio-psychological o ..."
Abstract - Cited by 35 (7 self) - Add to MetaCart
Abstract. This paper addresses the problem of free riding on peer-to-peer resource-sharing networks and explores methods for motivating more cooperative user behaviour via an adaptive interface. The paper argues that the free-riding problem is not so much an economic issue as a socio

Self-concordance at work: Toward understanding the motivational effects of transformational leaders.

by Joyce E Bono , Timothy A Judge - Academy of Management Journal, , 2003
"... We extend existing theories by linking transformational leadership to "self-concordance" at work. In two studies using diverse samples and methods, leader behaviors were associated with follower tendencies to set self-concordant goals. In general, followers of transformational leaders vie ..."
Abstract - Cited by 113 (3 self) - Add to MetaCart
(r ϭ .12), and satisfaction with the leader (r ϭ .08). Further examination of the data reveals that these associations are due to the autonomous motivation-job attitudes association, as there is no association between controlled motivation and job attitudes. Next we estimated a structural model

Efficient algorithms for document retrieval problems

by S. Muthukrishnan - In Proc. SODA , 2002
"... Abstract We are given a collection D of text documents d1; : : : ; dk, withP i jdij = n, which may be preprocessed. In the documentlisting problem, we are given an online query comprising of a pattern string p of length m and our goal is to return the set ofall documents that contain one or more cop ..."
Abstract - Cited by 107 (1 self) - Add to MetaCart
Abstract We are given a collection D of text documents d1; : : : ; dk, withP i jdij = n, which may be preprocessed. In the documentlisting problem, we are given an online query comprising of a pattern string p of length m and our goal is to return the set ofall documents that contain one or more

Evolution of Cooperative Problem-Solving in an Artificial Economy

by Eric B. Baum, Igor Durdanovic , 2000
"... We address the problem of how to reinforcement learn in ultra-complex environments, with huge state spaces, where one must learn to exploit compact structure of the problem domain. The approach we propose is to simulate the evolution of an artificial economy of computer programs. The economy is cons ..."
Abstract - Cited by 14 (1 self) - Add to MetaCart
to solve almost all random Blocks World problems with goal stacks 200 blocks high. Competing methods solve such problems only up to goal stacks of at most 8 blocks. Our economy has also learned to unscramble about half a randomly scrambled Rubik's cube, and to solve several among a collection
Results 11 - 20 of 1,470