Sciweavers

1160 search results - page 31 / 232
» Applying Constraint Solving to the Management of Distributed...
Sort
View
IPPS
1999
IEEE
15 years 6 months ago
Exploiting Application Tunability for Efficient, Predictable Parallel Resource Management
Parallel computing is becoming increasing central and mainstream, driven both by the widespread availability of commodity SMP and high-performance cluster platforms, as well as th...
Fangzhe Chang, Vijay Karamcheti, Zvi M. Kedem
CORR
2004
Springer
152views Education» more  CORR 2004»
15 years 1 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
115
Voted
ENTCS
2008
85views more  ENTCS 2008»
15 years 1 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset
ASAP
1997
IEEE
144views Hardware» more  ASAP 1997»
15 years 6 months ago
Automatic data mapping of signal processing applications
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
Corinne Ancourt, Denis Barthou, Christophe Guettie...
CORR
2010
Springer
195views Education» more  CORR 2010»
15 years 2 months ago
Dynamic management of transactions in distributed real-time processing system
Managing the transactions in real time distributed computing system is not easy, as it has heterogeneously networked computers to solve a single problem. If a transaction runs acr...
Y. Jayanta Singh, Yumnam Somananda Singh, Ashok Ga...