1712 search results - page 268 / 343 » A Computational Approach to Binding Theory |
122
click to vote
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
Recent research shows that significant energy saving can be achieved in wireless sensor networks with a mobile base station that collects data from sensor nodes via short-range co...
109
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
In this work an improvement of an initial approach to design Artificial Neural Networks to forecast Time Series is tackled, and the automatic process to design Artificial Neural N...
159
Voted
TASE
2008
IEEE
15 years 1 months ago
2008
IEEE
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...
122
click to vote
SMA
2008
ACM
15 years 1 months ago
2008
ACM
An algorithm and implementation is presented to compute the exact arrangement induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide. The family of Dupin cyc...
137
click to vote
WWW
2011
ACM
14 years 8 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...