Sciweavers

43264 search results - page 8059 / 8653
» Comparing models of computation
Sort
View
SIROCCO
2008
15 years 6 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
15 years 6 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
DLOG
2004
15 years 6 months ago
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
OPODIS
2004
15 years 6 months ago
Embedded Systems - Challenges and Work Directions
Embedded Systems are components integrating software and hardware jointly and specifically designed to provide given functionalities. These components may be used in many different...
Joseph Sifakis
NIPS
2001
15 years 6 months ago
Improvisation and Learning
This article presents a 2-phase computational learning model and application. As a demonstration, a system has been built, called CHIME for Computer Human Interacting Musical Enti...
Judy A. Franklin
« Prev « First page 8059 / 8653 Last » Next »