Sciweavers

9949 search results - page 362 / 1990
» On the Network Complexity of Selection
Sort
View
IEICET
2006
56views more  IEICET 2006»
15 years 6 months ago
Reconfiguration Heuristics for Logical Topologies in Wide-Area WDM Networks
Abstract--We propose several heuristic algorithms that reconfigure logical topologies in wide-area wavelength-routed optical networks. Our reconfiguration algorithms attempt to kee...
Hironao Takagi, Yongbing Zhang, Hideaki Takagi
200
Voted
NAR
2006
188views more  NAR 2006»
15 years 6 months ago
BiologicalNetworks: visualization and analysis tool for systems biology
Systemslevelinvestigationofgenomicscaleinformation requires the development of truly integrated databases dealing with heterogeneous data, which can be queried for simple properti...
Michael Baitaluk, Mayya Sedova, Animesh Ray, Amarn...
CEC
2008
IEEE
16 years 1 months ago
Learning what to ignore: Memetic climbing in topology and weight space
— We present the memetic climber, a simple search algorithm that learns topology and weights of neural networks on different time scales. When applied to the problem of learning ...
Julian Togelius, Faustino J. Gomez, Jürgen Sc...
ISCC
2006
IEEE
16 years 26 days ago
SASA: A Synthesis Scheduling Algorithm with Prediction and Sorting Features
We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. ...
Panagiotis G. Sarigiannidis, Georgios I. Papadimit...
IPSN
2003
Springer
16 years 1 days ago
Maximum Mutual Information Principle for Dynamic Sensor Query Problems
In this paper we study a dynamic sensor selection method for Bayesian filtering problems. In particular we consider the distributed Bayesian Filtering strategy given in [1] and sh...
Emre Ertin, John W. Fisher, Lee C. Potter