Sciweavers

11797 search results - page 267 / 2360
» Recent Developments in the Experimental
Sort
View
COMPSAC
2000
IEEE
15 years 11 months ago
LRU-SP: A Size-Adjusted and Popularity-Aware LRU Replacement Algorithm for Web Caching
This paper presents LRU-SP, a size-adjusted and popularity-aware extension to Least Recently Used (LRU) for caching web objects. The standard LRU, focusing on recently used and eq...
Kai Cheng, Yahiko Kambayashi
179
Voted
INFSOF
2006
170views more  INFSOF 2006»
15 years 6 months ago
How large are software cost overruns? A review of the 1994 CHAOS report
: The Standish Group reported in 1994 that the average cost overrun of software projects was as high as 189%. This cost overrun number is used as input in recent governmental repor...
Magne Jørgensen, Kjetil Moløkken-&Os...
NETWORKS
2008
15 years 6 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
CCE
2004
15 years 6 months ago
Part II. Future perspective on optimization
Following from part I, which presents a retrospective on optimization, we focus here on areas that are recent active research topics and are likely to strongly influence the futur...
Ignacio E. Grossmann, Lorenz T. Biegler
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 6 months ago
Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classificatio
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
Peter D. Turney