Sciweavers

5263 search results - page 992 / 1053
» Optimization with Extremal Dynamics
Sort
View
91
Voted
PLDI
1995
ACM
15 years 2 months ago
Selective Specialization for Object-Oriented Languages
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
Jeffrey Dean, Craig Chambers, David Grove
82
Voted
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 2 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
AIPS
2007
15 years 1 months ago
Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling
Many scheduling problems reside in uncertain and dynamic environments – tasks have a nonzero probability of failure and may need to be rescheduled. In these cases, an optimized ...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
93
Voted
USENIX
2008
15 years 1 months ago
FlexVol: Flexible, Efficient File Volume Virtualization in WAFL
zation is a well-known method of abstracting physical resources and of separating the manipulation and use of logical resources from their underlying implementation. We have used ...
John K. Edwards, Daniel Ellard, Craig Everhart, Ro...
83
Voted
AOSD
2008
ACM
15 years 27 days ago
Edicts: implementing features with flexible binding times
In a software product line, the binding time of a feature is the time at which one decides to include or exclude a feature from a product. Typical binding site implementations are...
Venkat Chakravarthy, John Regehr, Eric Eide