1568 search results - page 243 / 314 » The problem of examination questions in algorithmics |
118
click to vote
COCO
2006
Springer
15 years 8 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
156
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Topic modeling has been a key problem for document analysis. One of the canonical approaches for topic modeling is Probabilistic Latent Semantic Indexing, which maximizes the join...
128
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
107
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
185
click to vote
CONSTRAINTS
1998
15 years 3 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...