Sciweavers

16082 search results - page 35 / 3217
» Algorithms for Marketing-Mix Optimization
Sort
View
WAIM
2010
Springer
13 years 5 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le
ICTAI
1997
IEEE
13 years 12 months ago
Toward the Optimization of a Class of Black Box Optimization Algorithms
Many black box optimization algorithms have sufcient exibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: 1) ...
Gang Wang, Erik D. Goodman, William F. Punch III
MP
1998
109views more  MP 1998»
13 years 7 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
TON
2002
138views more  TON 2002»
13 years 7 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
WDAG
2004
Springer
86views Algorithms» more  WDAG 2004»
14 years 29 days ago
Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...
Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri