Sciweavers

4744 search results - page 494 / 949
» Connected Computing
Sort
View
COGSCI
2007
109views more  COGSCI 2007»
15 years 6 months ago
Understanding the Emergence of Modularity in Neural Systems
: Modularity in the human brain remains a controversial issue, with disagreement over the nature of the modules that exist, and why, when and how they emerge. It is a natural assum...
John A. Bullinaria
CORR
2007
Springer
76views Education» more  CORR 2007»
15 years 6 months ago
A Light-Based Device for Solving the Hamiltonian Path Problem
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...
Mihai Oltean
JPDC
2008
103views more  JPDC 2008»
15 years 6 months ago
On termination detection in crash-prone distributed systems with failure detectors
We investigate the problem of detecting termination of a distributed computation in systems where processes can fail by crashing. Specifically, when the communication topology is ...
Neeraj Mittal, Felix C. Freiling, Subbarayan Venka...
DSS
2007
109views more  DSS 2007»
15 years 6 months ago
Dealing with the effects of context mismatch in group work
The context concept can be used with advantage in the area of Computer-Supported Cooperative Work. In many studies, several forms of context have been used without explicit associ...
Marcos R. S. Borges, Patrick Brézillon, Jos...
JGAA
2006
108views more  JGAA 2006»
15 years 6 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello