Sciweavers

32 search results - page 2 / 7
» On changing cofinality of partially ordered sets
Sort
View
AIPS
2010
13 years 4 months ago
Forward-Chaining Partial-Order Planning
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
13 years 2 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
ECSQARU
2005
Springer
13 years 10 months ago
Multiple Semi-revision in Possibilistic Logic
Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a n...
Guilin Qi, Weiru Liu, David A. Bell
FLAIRS
2008
13 years 6 months ago
Answer Set Programming on Expert Feedback to Populate and Extend Dynamic Ontologies
The next generation of online reference works will require structured representations of their contents in order to support scholarly functions such as semantic search, automated ...
Mathias Niepert, Cameron Buckner, Colin Allen
MSR
2006
ACM
13 years 10 months ago
Mining sequences of changed-files from version histories
Modern source-control systems, such as Subversion, preserve change-sets of files as atomic commits. However, the specific ordering information in which files were changed is typic...
Huzefa H. Kagdi, Shehnaaz Yusuf, Jonathan I. Malet...