20638 search results - page 192 / 4128 » Network Computing |
157
click to vote
NDJFL
2010
15 years 1 months ago
2010
We study completely decomposable torsion-free abelian groups of the form GS := nSQpn for sets S . We show that GS has a decidable copy if and only if S is 0 2 and has a computable...
146
Voted
JCB
2008
15 years 6 months ago
2008
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock out sets of reactions required to block a given behaviour....
165
click to vote
ICRA
2008
IEEE
16 years 27 days ago
2008
IEEE
— In this work we tackle the road sign problem with Reservoir Computing (RC) networks. The T-maze task (a particular form of the road sign problem) consists of a robot in a T-sha...
213
click to vote
IEEEARES
2006
IEEE
16 years 15 days ago
2006
IEEE
Most current anomaly Intrusion Detection Systems (IDSs) detect computer network behavior as normal or abnormal but cannot identify the type of attacks. Moreover, most current intr...
161
click to vote
ICCNMC
2005
Springer
15 years 12 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...