2210 search results - page 246 / 442 » Information complexity of neural networks |
176
click to vote
NIPS
1993
15 years 8 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
199
click to vote
DAC
2010
ACM
15 years 10 months ago
2010
ACM
Online social networks are a growing internet phenomenon: they connect millions of individuals through sharing of common interests, political and religious views, careers, etc. So...
167
click to vote
IM
2008
15 years 6 months ago
2008
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
205
click to vote
MOBIHOC
2000
ACM
15 years 11 months ago
2000
ACM
— This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic routing (DDR)....
190
click to vote
RIVF
2003
15 years 8 months ago
2003
— Home networking is the collection of elements that process, manage, transport and store information, enabling the connection and integration of multiple computing, control, mon...