Sciweavers

2479 search results - page 242 / 496
» A Computational Theory of Working Memory
Sort
View
POLICY
2005
Springer
16 years 5 days ago
Approximating Service Utility from Policies and Value Function Patterns
Service-oriented computing provides the right means for building flexible systems that allow dynamic configuration and on-the-fly composition. In order to realize this vision, ...
Steffen Lamparter, Daniel Oberle, Andreas Eberhart
SIGDOC
2004
ACM
16 years 3 days ago
Assessing effectiveness of personality style in documentation
This paper extends previous work by other researchers that indicated that users of computers preferred a computer with a personality that was similar to theirs. We conducted a sim...
Kenneth Sayles, David G. Novick
FOSSACS
2003
Springer
15 years 12 months ago
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity
In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compu...
Franck van Breugel, Michael W. Mislove, Joël ...
188
Voted
CDC
2009
IEEE
165views Control Systems» more  CDC 2009»
15 years 11 months ago
Achieving symmetric Pareto Nash equilibria using biased replicator dynamics
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
Kiran Somasundaram, John S. Baras
EMMCVPR
2001
Springer
15 years 11 months ago
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
Marcello Pelillo