Sciweavers

1452 search results - page 172 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
COLT
2005
Springer
15 years 6 months ago
Martingale Boosting
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
Philip M. Long, Rocco A. Servedio
118
Voted
PPDP
2005
Springer
15 years 6 months ago
Self-tuning resource aware specialisation for prolog
The paper develops a self-tuning resource aware partial evaluation technique for Prolog programs, which derives its own control strategies tuned for the underlying computer archit...
Stephen-John Craig, Michael Leuschel
128
Voted
HIPC
2007
Springer
15 years 4 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
104
Voted
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
15 years 7 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
123
Voted
ECOOP
2006
Springer
15 years 4 months ago
Automated Detection of Refactorings in Evolving Components
Abstract. One of the costs of reusing software components is updating applications to use the new version of the components. Updating an application can be error-prone, tedious, an...
Danny Dig, Can Comertoglu, Darko Marinov, Ralph E....