Sciweavers

612 search results - page 105 / 123
» Hardness assumptions in the foundations of theoretical compu...
Sort
View
FOCS
2003
IEEE
14 years 1 months ago
Approximation Algorithms for Orienteering and Discounted-Reward TSP
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
Avrim Blum, Shuchi Chawla, David R. Karger, Terran...
EXPCS
2007
13 years 11 months ago
Introducing entropies for representing program behavior and branch predictor performance
Predictors are inherent components of state-of-the-art microprocessors. Branch predictors are discussed actively from diverse perspectives. Performance of a branch predictor large...
Takashi Yokota, Kanemitsu Ootsu, Takanobu Baba
FOCS
2008
IEEE
13 years 8 months ago
Minimizing Movement in Mobile Facility Location Problems
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
Zachary Friggstad, Mohammad R. Salavatipour
GG
2008
Springer
13 years 8 months ago
Model-Driven Development of Model Transformations
The model-driven development of model transformations requires both a technique to model model transformations as well as a means to transform transformation models. Therefore, t...
Pieter Van Gorp
ACMSE
2006
ACM
14 years 1 months ago
Middleware specialization using aspect oriented programming
Standardized middleware is used to build large distributed real-time and enterprise (DRE) systems. These middleware are highly flexible and support a large number of features sin...
Dimple Kaul, Aniruddha S. Gokhale