4791 search results - page 891 / 959 » Clustering with partial information |
155
click to vote
AIPS
2006
15 years 6 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
140
click to vote
FOIS
2006
15 years 6 months ago
2006
The field of BioInformatics has become a major venue for the development and application of computational ontologies. Ranging from controlled vocabularies to annotation of experim...
116
click to vote
DAIS
2003
15 years 6 months ago
2003
Some of the data available to today’s enterprise applications is inconsistent. This is an inevitable consequence of data being distributed and partially replicated in many locati...
160
click to vote
SDM
2003
SIAM
15 years 6 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
130
click to vote
ANLP
1997
15 years 6 months ago
1997
Appointment scheduling is a problem faced daily by many individuals and organizations. Cooperating agent systems have been developed to partially automate this task. In order to e...