Sciweavers

2979 search results - page 375 / 596
» Computation and the Periodic Table
Sort
View
AI
2006
Springer
15 years 6 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
CORR
2006
Springer
104views Education» more  CORR 2006»
15 years 6 months ago
Unmanaged Internet Protocol: Taming the Edge Network Management Crisis
Though appropriate for core Internet infrastructure, the Internet Protocol is unsuited to routing within and between emerging ad-hoc edge networks due to its dependence on hierarc...
Bryan Ford
JCST
2008
203views more  JCST 2008»
15 years 6 months ago
Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks
Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor sca...
Xue Zhang, Jue Hong, Sanglu Lu, Li Xie, Jiannong C...
JUCS
2008
138views more  JUCS 2008»
15 years 6 months ago
A Knowledge Discovery Agent for a Topology Bit-map in Ad Hoc Mobile Networks
: A central characteristic of ad hoc mobile networks is the frequent changes of their topology. This is the source of many problems that need to be solved. AODV is an on-demand rou...
SungSoo Lee, HangKon Kim, ChongGun Kim
TFS
2008
116views more  TFS 2008»
15 years 6 months ago
Fuzzifying Allen's Temporal Interval Relations
When the time span of an event is imprecise, it can be represented by a fuzzy set, called a fuzzy time interval. In this paper, we propose a framework to represent, compute, and re...
Steven Schockaert, Martine De Cock, Etienne E. Ker...