We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agent-based) language . That language is primarily m...
Pierre-Louis Curien, Vincent Danos, Jean Krivine, ...
Users of search engines express their needs as queries, typically consisting of a small number of terms. The resulting search engine query logs are valuable resources that can be ...
Milad Shokouhi, Justin Zobel, Seyed M. M. Tahaghog...
As access to information becomes more intensive in society, a great deal of that information is becoming available through diverse channels. Accordingly, users require effective ...