Sciweavers

2314 search results - page 255 / 463
» Minimal Partitions of a Graph
Sort
View
COGSCI
2010
107views more  COGSCI 2010»
15 years 4 months ago
Inferring Hidden Causal Structure
We used a new method to assess how people can infer unobserved causal structure from patterns of observed events. Participants were taught to draw causal graphs, and then shown a ...
Tamar Kushnir, Alison Gopnik, Chris Lucas, Laura S...
CORR
2008
Springer
125views Education» more  CORR 2008»
15 years 4 months ago
Data Reduction in Intrusion Alert Correlation
: Network intrusion detection sensors are usually built around low level models of network traffic. This means that their output is of a similarly low level and as a consequence, ...
Gianni Tedesco, Uwe Aickelin
CORR
2006
Springer
95views Education» more  CORR 2006»
15 years 4 months ago
Naming Games in Spatially-Embedded Random Networks
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
Qiming Lu, Gyorgy Korniss, Boleslaw K. Szymanski
JCST
2008
85views more  JCST 2008»
15 years 4 months ago
A General Approach to L ( h, k )-Label Interconnection Networks
d Abstract) Tiziana Calamoneri 1 , Saverio Caminiti 2 , and Rossella Petreschi 3 Dipartimento di Informatica Universit`a degli Studi di Roma "La Sapienza" Via Salaria 113...
Tiziana Calamoneri, Saverio Caminiti, Rossella Pet...
ICRA
2010
IEEE
131views Robotics» more  ICRA 2010»
15 years 3 months ago
Optimal coverage of a known arbitrary environment
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
Raphael Mannadiar, Ioannis M. Rekleitis