Sciweavers

13214 search results - page 129 / 2643
» Pseudorandomness for network algorithms
Sort
View
AAAI
1996
15 years 7 months ago
Constructive Neural Network Learning Algorithms
Constructive learning algorithms offer an attractive approach for the incremental construction of near-minimal neural-network architectures for pattern classification. They help ov...
Rajesh Parekh, Jihoon Yang, Vasant Honavar
ADMA
2006
Springer
121views Data Mining» more  ADMA 2006»
16 years 13 days ago
A New Polynomial Time Algorithm for Bayesian Network Structure Learning
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
Sanghack Lee, Jihoon Yang, Sungyong Park
JSAC
2006
88views more  JSAC 2006»
15 years 6 months ago
Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks
This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converter...
Nina Skorin-Kapov
ICDCIT
2005
Springer
15 years 12 months ago
Merging Clustering Algorithms in Mobile Ad Hoc Networks
Abstract. Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a n...
Orhan Dagdeviren, Kayhan Erciyes, Deniz Cokuslu
ISCIS
2004
Springer
15 years 11 months ago
A Tabu Search Algorithm for Sparse Placement of Wavelength Converters in Optical Networks
Abstract. In this paper, we study the problem of placing limited number of wavelength converting nodes in a multi-fiber network with static traffic demands and propose a tabu sear...
Namik Sengezer, Ezhan Karasan