Sciweavers

2693 search results - page 11 / 539
» On Computing Complex Navigation Functions
Sort
View
CHI
2005
ACM
14 years 10 months ago
Shared landmarks in complex coordination environments
We explore the concept of social landmarks in complex, shared information and coordination environments. Previous research in navigation and shared spaces has tended to emphasize ...
Michael J. Muller, Olga Kuchinskaya, Suzanne O. Mi...
MFCS
1990
Springer
14 years 1 months ago
One-Way Functions in Complexity Theory
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
Alan L. Selman
ICALP
2004
Springer
14 years 3 months ago
The Complexity of Partition Functions
Andrei A. Bulatov, Martin Grohe
FSTTCS
2008
Springer
13 years 11 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux
IJCGA
2010
155views more  IJCGA 2010»
13 years 8 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon