108 search results - page 6 / 22 » Computational Discovery in Pure Mathematics |
ICDCSW
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we present a gossip based protocol for path discovery in Mobile Ad Hoc Networks (MANETs). While in the classical gossip algorithm each node forwards a packet with th...
ACMSE
2005
ACM
14 years 1 months ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
PERCOM
2009
ACM
14 years 8 months ago
2009
ACM
In pervasive computing environments, applications find themselves in constantly changing operating conditions. Such applications often need to discover locally available resources ...
DKE
2002
13 years 7 months ago
2002
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...