5799 search results - page 248 / 1160 » Position Paper |
129
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
IJCAI
2007
15 years 5 months ago
2007
Buyers and sellers in online auctions are faced with the task of deciding who to entrust their business to based on a very limited amount of information. Current trust ratings on ...
128
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
123
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a posit...
152
click to vote
AROBOTS
2008
15 years 3 months ago
2008
This paper presents a novel method for enabling a robot to determine the position of a sound source in three dimensions using just two microphones and interaction with its environm...