Sciweavers

5539 search results - page 65 / 1108
» What can be computed locally
Sort
View
AO
2007
80views more  AO 2007»
13 years 10 months ago
Problems in the ontology of computer programs
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
Amnon H. Eden, Raymond Turner
AAAI
2007
14 years 8 days ago
On the Prospects for Building a Working Model of the Visual Cortex
Human visual capability has remained largely beyond the reach of engineered systems despite intensive study and considerable progress in problem understanding, algorithms and comp...
Thomas Dean, Glenn Carroll, Richard Washington
ICRA
2008
IEEE
150views Robotics» more  ICRA 2008»
14 years 4 months ago
A Bayesian approach to empirical local linearization for robotics
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
Jo-Anne Ting, Aaron D'Souza, Sethu Vijayakumar, St...
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 10 months ago
Pushing BitTorrent Locality to the Limit
Peer-to-peer (P2P) locality has recently raised a lot of interest in the community. Indeed, whereas P2P content distribution enables financial savings for the content providers, i...
Stevens Le-Blond, Arnaud Legout, Walid Dabbous
CIE
2008
Springer
13 years 12 months ago
Computable Categoricity of Graphs with Finite Components
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu