Sciweavers

129 search results - page 14 / 26
» Benchmarking Reasoners for Multi-Ontology Applications
Sort
View
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 8 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
CEC
2009
IEEE
14 years 2 months ago
Improved memetic algorithm for Capacitated Arc Routing Problem
— Capacitated Arc Routing Problem (CARP) has attracted much interest because of its wide applications in the real world. Recently, a memetic algorithm proposed by Lacomme et al. ...
Yi Mei, Ke Tang, Xin Yao
BTW
2009
Springer
146views Database» more  BTW 2009»
14 years 2 months ago
Towards Flash Disk Use in Databases - Keeping Performance While Saving Energy?
Abstract: Green computing or energy saving when processing information is primarily considered a task of processor development. We, however, advocate that a holistic approach is ne...
Theo Härder, Karsten Schmidt 0002, Yi Ou, Seb...
ETS
2006
IEEE
110views Hardware» more  ETS 2006»
14 years 1 months ago
Deterministic Logic BIST for Transition Fault Testing
BIST is an attractive approach to detect delay faults due to its inherent support for at-speed test. Deterministic logic BIST (DLBIST) is a technique which was successfully applie...
Valentin Gherman, Hans-Joachim Wunderlich, Jü...
CC
2005
Springer
153views System Software» more  CC 2005»
14 years 1 months ago
Completeness Analysis for Incomplete Object-Oriented Programs
We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
Jingling Xue, Phung Hua Nguyen