Sciweavers

7228 search results - page 623 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
WSC
1998
15 years 8 months ago
An Analytical Comparison of Optimization Problem Generation Methodologies
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
Raymond R. Hill
CN
2007
154views more  CN 2007»
15 years 7 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
JCS
2006
81views more  JCS 2006»
15 years 7 months ago
Effective worm detection for various scan techniques
In recent years, the threats and damages caused by active worms have become more and more serious. In order to reduce the loss caused by fastspreading active worms, an effective de...
Jianhong Xia, Sarma Vangala, Jiang Wu, Lixin Gao, ...
EOR
2007
69views more  EOR 2007»
15 years 7 months ago
Incorporating inventory and routing costs in strategic location models
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...
Zuo-Jun Max Shen, Lian Qi
ML
2006
ACM
121views Machine Learning» more  ML 2006»
15 years 7 months ago
Model-based transductive learning of the kernel matrix
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung