Sciweavers

8780 search results - page 15 / 1756
» On the Feasibility of Consistent Computations
Sort
View
CONCUR
2012
Springer
13 years 22 hour ago
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
Guy Avni, Orna Kupferman
HPCA
1996
IEEE
15 years 1 months ago
A Comparison of Entry Consistency and Lazy Release Consistency Implementations
This paper compares several implementations of entry consistency (EC) and lazy release consistency (LRC), two relaxed memory models in use with software distributed shared memory ...
Sarita V. Adve, Alan L. Cox, Sandhya Dwarkadas, Ra...
PODS
2003
ACM
151views Database» more  PODS 2003»
15 years 9 months ago
Feasible itemset distributions in data mining: theory and application
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
Ganesh Ramesh, William Maniatty, Mohammed Javeed Z...
RTCSA
2003
IEEE
15 years 2 months ago
Scheduling Jobs with Multiple Feasible Intervals
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...
Chi-Sheng Shih, Jane W.-S. Liu, Infan Kuok Cheong
EGICE
2006
15 years 1 months ago
Coordinating Goals, Preferences, Options, and Analyses for the Stanford Living Laboratory Feasibility Study
This paper describes an initial application of Multi-Attribute Collective Decision Analysis for a Design Initiative (MACDADI) on the feasibility study of a mixed-use facility. Firs...
John Haymaker, John Chachere