Sciweavers

1033 search results - page 57 / 207
» The Relative History Heuristic
Sort
View
SYNTHESE
2010
76views more  SYNTHESE 2010»
14 years 10 months ago
The epistemic goal of a concept: accounting for the rationality of semantic change and variation
: The discussion presents a framework of concepts that is intended to account for the rationality of semantic change and variation, suggesting that each scientific concept consists...
Ingo Brigandt
GRAPHICSINTERFACE
2009
14 years 9 months ago
QuickSelect: history-based selection expansion
When editing a graphical document, it is common to apply a change to multiple items at once, and a variety of tools exist for selecting sets of items. However, directly selecting ...
Sara L. Su, Sylvain Paris, Frédo Durand
CIDR
2011
233views Algorithms» more  CIDR 2011»
14 years 3 months ago
Ibis: A Provenance Manager for Multi-Layer Systems
End-to-end data processing environments are often comprised of several independently-developed (sub-)systems, e.g. for engineering, organizational or historical reasons. Unfortuna...
Christopher Olston, Anish Das Sarma
HYBRID
2010
Springer
15 years 6 months ago
Real-time scheduling of mixture-of-experts systems with limited resources
Mixture-of-Experts (MoE) systems solve intricate problems by combining results generated independently by multiple computational models (the “experts”). Given an instance of a...
Prapaporn Rattanatamrong, José A. B. Fortes
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 4 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla