Sciweavers

1047 search results - page 137 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
AIPS
2009
13 years 9 months ago
A Semantics for HTN Methods
Despite the extensive development of first-principles planning in recent years, planning applications are still primarily developed using knowledge-based planners which can exploi...
Robert P. Goldman
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 8 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
IJFCS
2006
83views more  IJFCS 2006»
13 years 8 months ago
A Simple Alphabet-independent Fm-index
Abstract. We design a succinct full-text index based on the idea of Huffmancompressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can...
Szymon Grabowski, Gonzalo Navarro, Rafal Przywarsk...
WCRE
2009
IEEE
14 years 2 months ago
Automatic Package Coupling and Cycle Minimization
Abstract—Object-oriented (OO) software is usually organized into subsystems using the concepts of package or module. Such modular structure helps applications to evolve when faci...
Hani Abdeen, Stéphane Ducasse, Houari A. Sa...
SPIN
2004
Springer
14 years 1 months ago
Directed Error Detection in C++ with the Assembly-Level Model Checker StEAM
Most approaches for model checking software are based on ration of abstract models from source code, which may greatly reduce the search space, but may also introduce errors that a...
Peter Leven, Tilman Mehler, Stefan Edelkamp