Sciweavers

8067 search results - page 132 / 1614
» A Model Proposal of the Interoperability Problem
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 3 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
AAAI
1994
15 years 4 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
248
Voted
NLP
2000
15 years 7 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
IOR
2006
126views more  IOR 2006»
15 years 3 months ago
A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems
We consider the problem of radiation therapy treatment planning for cancer patients. During radiation therapy, beams of radiation pass through a patient, killing both cancerous an...
H. Edwin Romeijn, Ravindra K. Ahuja, James F. Demp...
ICAC
2009
IEEE
15 years 10 months ago
Ranking the importance of alerts for problem determination in large computer systems
The complexity of large computer systems has raised unprecedented challenges for system management. In practice, operators often collect large volume of monitoring data from system...
Guofei Jiang, Haifeng Chen, Kenji Yoshihira, Akhil...