Sciweavers

909 search results - page 63 / 182
» On the approximability of some network design problems
Sort
View
ICCAD
2003
IEEE
113views Hardware» more  ICCAD 2003»
16 years 3 months ago
Branch Merge Reduction of RLCM Networks
— In this paper we consider the problem of finding a smaller RLCM circuit that approximately replicates the behavior (up to a certain frequency) of a given RLCM circuit. Targeted...
Bernard N. Sheehan
APSCC
2007
IEEE
15 years 6 months ago
Joint Sink Mobility and Data Diffusion for Lifetime Optimization in Wireless Sensor Networks
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...
Yu Gu, Hengchang Liu, Fei Song, Baohua Zhao
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
15 years 4 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...
ICANN
2001
Springer
15 years 10 months ago
A Computational Intelligence Approach to Optimization with Unknown Objective Functions
In many practical engineering design problems, the form of objective function is not given explicitly in terms of design variables. Given the value of design variables, under this ...
Hirotaka Nakayama, Masao Arakawa, Rie Sasaki
CDC
2008
IEEE
110views Control Systems» more  CDC 2008»
15 years 8 months ago
Topological identification in networks of dynamical systems
The paper deals with the problem of reconstructing the tree-like topological structure of a network of linear dynamical systems. A distance function is defined in order to evaluat...
Donatello Materassi, Giacomo Innocenti