Sciweavers

2436 search results - page 206 / 488
» Comonadic Notions of Computation
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 4 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen
JAIR
2008
145views more  JAIR 2008»
15 years 4 months ago
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
Sylvain Bouveret, Jérôme Lang
JALC
2006
61views more  JALC 2006»
15 years 4 months ago
Random Polynomial-Time Attacks and Dolev-Yao Models
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
Mathieu Baudet
JMLR
2007
58views more  JMLR 2007»
15 years 4 months ago
Distances between Data Sets Based on Summary Statistics
The concepts of similarity and distance are crucial in data mining. We consider the problem of defining the distance between two data sets by comparing summary statistics compute...
Nikolaj Tatti
VC
2008
94views more  VC 2008»
15 years 4 months ago
Virtual world explorations by using topological and semantic knowledge
This paper is dedicated to virtual world exploration techniques. Automatic camera control is important in many fields as computational geometry, visual servoing, robot motion, grap...
Dmitry Sokolov, Dimitri Plemenos