Sciweavers

1500 search results - page 299 / 300
» Programming Agents with Emotions
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 9 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
DIAGRAMS
2006
Springer
13 years 7 months ago
From Diagrams to Models by Analogical Transfer
Abstract. We present a method for constructing a teleological model of a drawing of a physical device through analogical transfer of the teleological model of the same device in an...
Patrick W. Yaner, Ashok K. Goel
LBM
2007
13 years 6 months ago
Decentralised Clinical Guidelines Modelling with Lightweight Coordination Calculus
Background: Clinical protocols and guidelines have been considered as a major means to ensure that cost-effective services are provided at the point of care. Recently, the comput...
Bo Hu, Srinandan Dasmahapatra, David Robertson, Pa...
ACSW
2006
13 years 6 months ago
Catching spam before it arrives: domain specific dynamic blacklists
1 The arrival of any piece of unsolicited and unwanted email (spam) into a user's email inbox is a problem. It results in real costs to organisations and possibly an increasin...
Duncan Cook, Jacky Hartnett, Kevin Manderson, Joel...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 5 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner