Sciweavers

7123 search results - page 1146 / 1425
» The Ordered Set of Rough Sets
Sort
View
COGSR
2011
109views more  COGSR 2011»
15 years 1 months ago
How groups develop a specialized domain vocabulary: A cognitive multi-agent model
We simulate the evolution of a domain vocabulary in small communities. Empirical data show that human communicators can evolve graphical languages quickly in a constrained task (P...
David Reitter, Christian Lebiere
COMGEO
2011
ACM
15 years 1 months ago
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...
CORR
2011
Springer
170views Education» more  CORR 2011»
15 years 1 months ago
Performance Comparison and Analysis of Preemptive-DSR and TORA
The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. Preemptiv...
V. Ramesh, P. Subbaiah, N. Koteswar Rao, N. Subhas...
CORR
2011
Springer
203views Education» more  CORR 2011»
15 years 1 months ago
Guided Data Repair
In this paper we present GDR, a Guided Data Repair framework that incorporates user feedback in the cleaning process to enhance and accelerate existing automatic repair techniques...
Mohamed Yakout, Ahmed K. Elmagarmid, Jennifer Nevi...
CORR
2011
Springer
149views Education» more  CORR 2011»
15 years 1 months ago
General Iteration graphs and Boolean automata circuits
This article is set in the eld of regulation networks modeled by discrete dynamical systems. It focuses on Boolean automata networks. In such networks, there are many ways to upd...
Mathilde Noual
« Prev « First page 1146 / 1425 Last » Next »