Sciweavers

3134 search results - page 73 / 627
» Computing full disjunctions
Sort
View
IAT
2009
IEEE
14 years 4 months ago
Computing Information Minimal Match Explanations for Logic-Based Matchmaking
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
HICSS
2007
IEEE
109views Biometrics» more  HICSS 2007»
14 years 4 months ago
Towards Reliable Computation of Large-Scale Market-Based Optimal Power Flow
The deregulated electricity market calls for robust OPF tools that can provide (a) deterministic convergence, (b) accurate computation of a variety of nodal prices, (c) support of...
Hongye Wang, Robert J. Thomas
SC
2005
ACM
14 years 3 months ago
Massive High-Performance Global File Systems for Grid computing
In this paper we describe the evolution of Global File Systems from the concept of a few years ago, to a first demonstration using hardware Fibre Channel frame encoding into IP pa...
Phil Andrews, Patricia A. Kovatch, Chris Jordan
ICDM
2002
IEEE
156views Data Mining» more  ICDM 2002»
14 years 2 months ago
On Computing Condensed Frequent Pattern Bases
Frequent pattern mining has been studied extensively. However, the effectiveness and efficiency of this mining is often limited, since the number of frequent patterns generated i...
Jian Pei, Guozhu Dong, Wei Zou, Jiawei Han
SIGCSE
1999
ACM
193views Education» more  SIGCSE 1999»
14 years 2 months ago
Cache conscious programming in undergraduate computer science
The wide-spread use of microprocessor based systems that utilize cache memory to alleviate excessively long DRAM access times introduces a new dimension in the quest to obtain goo...
Alvin R. Lebeck