Sciweavers

3433 search results - page 235 / 687
» Heuristics for a bidding problem
Sort
View
IPCCC
2005
IEEE
16 years 8 days ago
Utilizing characteristics of last link to improve TCP performance
TCP, perhaps the most widely used transport protocol, was designed for wired links and stationary hosts. But more and more links with different characteristics are used to access...
Xiuchao Wu, I. Biswas, Mun Choon Chan, Akkihebbal ...
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
15 years 11 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
ICDCS
2000
IEEE
15 years 11 months ago
Static and Adaptive Data Replication Algorithms for Fast Information Access in Large Distributed Systems
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
Thanasis Loukopoulos, Ishfaq Ahmad
IPPS
2000
IEEE
15 years 11 months ago
A Parallel Co-evolutionary Metaheuristic
In order to show that the parallel co-evolution of di erent heuristic methods may lead to an e cient search strategy, we have hybridized three heuristic agents of complementary beh...
Vincent Bachelet, El-Ghazali Talbi
CP
1995
Springer
15 years 10 months ago
Dynamic Variable Ordering in CSPs
Abstract. We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We fi...
Fahiem Bacchus, Paul van Run