Sciweavers

392 search results - page 70 / 79
» Modular Competitiveness for Distributed Algorithms
Sort
View
CP
2004
Springer
15 years 3 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
CP
2008
Springer
14 years 11 months ago
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
Wanxia Wei, Chu Min Li, Harry Zhang
ICS
2011
Tsinghua U.
14 years 1 months ago
Scalable fine-grained call path tracing
Applications must scale well to make efficient use of even medium-scale parallel systems. Because scaling problems are often difficult to diagnose, there is a critical need for sc...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
93
Voted
ATAL
2011
Springer
13 years 9 months ago
Online mechanism design for electric vehicle charging
Plug-in hybrid electric vehicles are expected to place a considerable strain on local electricity distribution networks, requiring charging to be coordinated in order to accommoda...
Enrico H. Gerding, Valentin Robu, Sebastian Stein,...
SIGMETRICS
2004
ACM
118views Hardware» more  SIGMETRICS 2004»
15 years 3 months ago
A game theoretic approach to provide incentive and service differentiation in P2P networks
Traditional Peer-to-Peer (P2P) networks do not provide service differentiation and incentive for users. Consequently, users can easily access information without contributing any ...
Richard T. B. Ma, Sam C. M. Lee, John C. S. Lui, D...