2110 search results - page 366 / 422 » What is the complexity of a distributed computing system |
130
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a succ...
137
click to vote
WOLLIC
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...
167
click to vote
IROS
2006
IEEE
15 years 10 months ago
2006
IEEE
— We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...
171
click to vote
HRI
2006
ACM
15 years 10 months ago
2006
ACM
The design and development of social robots that interact and assist people in daily life requires moving into unconstrained daily-life environments. This presents unexplored meth...
125
click to vote
IMC
2003
ACM
15 years 9 months ago
2003
ACM
Border Gateway Protocol allows Autonomous Systems (ASs) to apply diverse routing policies for selecting routes and for propagating reachability information to other ASs. Although ...