Sciweavers

2020 search results - page 33 / 404
» KDD Process Planning
Sort
View
FUIN
2006
139views more  FUIN 2006»
14 years 9 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
APPINF
2003
14 years 11 months ago
A Method for Teaching a Software Process based on the Personal Software Process
The paper presents a method in teaching software process at under-graduate level, based on the Personal Software Process (PSP). The goal is to inform students about the process an...
Zeljka Car
54
Voted
AIPS
2006
14 years 11 months ago
On the Use of UML.P for Modeling a Real Application as a Planning Problem
There is a great interest in the planning community to apply all developments already achieved in the area to real applications. Such scenario makes the community focus on Knowled...
Tiago Stegun Vaquero, Flavio Tonidandel, Leliane N...
KDD
1995
ACM
193views Data Mining» more  KDD 1995»
15 years 1 months ago
Analyzing the Benefits of Domain Knowledge in Substructure Discovery
Discovering repetitive, interesting, and functional substructures in a structural database improves the ability to interpret and compress the data. However, scientists working wit...
Surnjani Djoko, Diane J. Cook, Lawrence B. Holder
82
Voted
IPPS
2006
IEEE
15 years 3 months ago
Plan switching: an approach to plan execution in changing environments
The execution of a complex task in any environment requires planning. Planning is the process of constructing an activity graph given by the current state of the system, a goal st...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...