Sciweavers

3758 search results - page 537 / 752
» A Complete Subsumption Algorithm
Sort
View
ICML
2007
IEEE
16 years 3 months ago
On learning linear ranking functions for beam search
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
Yuehua Xu, Alan Fern
ICML
2008
IEEE
16 years 3 months ago
Boosting with incomplete information
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...
Feng Jiao, Gholamreza Haffari, Greg Mori, Shaojun ...
ICML
2005
IEEE
16 years 3 months ago
A new Mallows distance based metric for comparing clusterings
Despite of the large number of algorithms developed for clustering, the study on comparing clustering results is limited. In this paper, we propose a measure for comparing cluster...
Ding Zhou, Jia Li, Hongyuan Zha
ICSE
2008
IEEE-ACM
16 years 3 months ago
Temporal dependency based checkpoint selection for dynamic verification of fixed-time constraints in grid workflow systems
In grid workflow systems, temporal correctness is critical to assure the timely completion of grid workflow execution. To monitor and control the temporal correctness, fixed-time ...
Jinjun Chen, Yun Yang
SIGSOFT
2006
ACM
16 years 3 months ago
Local analysis of atomicity sphere for B2B collaboration
Atomicity is a desirable property for business processes to conduct transactions in Business-to-Business (B2B) collaboration. Although it is possible to reason about atomicity of ...
Chunyang Ye, S. C. Cheung, W. K. Chan, Chang Xu