Sciweavers

909 search results - page 83 / 182
» On the approximability of some network design problems
Sort
View
ICONIP
1998
15 years 7 months ago
Computing Iterative Roots with Neural Networks
Many real processes are composed of a n-fold repetition of some simpler process. If the whole process can be modelled with a neural network, we present a method to derive a model ...
Lars Kindermann
TON
2008
134views more  TON 2008»
15 years 6 months ago
Efficient broadcasting using network coding
Abstract-- We consider the problem of broadcasting in an adhoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Ou...
Christina Fragouli, Jörg Widmer, Jean-Yves Le...
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
16 years 10 days ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
EUC
2005
Springer
15 years 11 months ago
Dynamic Resource Discovery for Sensor Networks
As sensor networks mature the current generation of sensor networks that are application-specific and exposed only to a limited set of users will give way to heterogeneous sensor ...
Sameer Tilak, Kenneth Chiu, Nael B. Abu-Ghazaleh, ...
WIOPT
2006
IEEE
16 years 7 days ago
Scheduling sensor activity for point information coverage in wireless sensor networks
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...