Sciweavers

703 search results - page 82 / 141
» Using Cases Utility for Heuristic Planning Improvement
Sort
View
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
14 years 1 days ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
13 years 11 months ago
"Optimal" mutation rates for genetic search
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
Jorge Cervantes, Christopher R. Stephens
PARA
2004
Springer
14 years 1 months ago
Analyzing Advanced PDE Solvers Through Simulation
Abstract. By simulating a real computer it is possible to gain a detailed knowledge of the cache memory utilization of an application, e.g., a partial differential equation (PDE) s...
Henrik Johansson, Dan Wallin, Sverker Holmgren
IAT
2003
IEEE
14 years 1 months ago
Asymmetric Multiagent Reinforcement Learning
A gradient-based method for both symmetric and asymmetric multiagent reinforcement learning is introduced in this paper. Symmetric multiagent reinforcement learning addresses the ...
Ville Könönen
MASCOTS
2003
13 years 9 months ago
Minimizing Packet Loss by Optimizing OSPF Weights Using Online Simulation
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
Hema Tahilramani Kaur, Tao Ye, Shivkumar Kalyanara...