5316 search results - page 251 / 1064 » Which Search Problems Are Random |
224
click to vote
SIGECOM
2011
ACM
14 years 7 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
107
click to vote
ICTAI
2003
IEEE
15 years 10 months ago
2003
IEEE
Local search-based methods of SAT solving have received a significant attention in the last decade. All local search-based methods choose the next truth assignment by flipping t...
152
click to vote
ASPLOS
2010
ACM
15 years 3 months ago
2010
ACM
Semantic indexing is a popular technique used to access and organize large amounts of unstructured text data. We describe an optimized implementation of semantic indexing and docu...
128
click to vote
ERCIMDL
2004
Springer
15 years 10 months ago
2004
Springer
In maintaining Digital Libraries, having bibliographic data up-to-date is critical, yet often minor irregularities may cause information isolation. Unlike documents for which vario...
175
click to vote
SIAMJO
2002
15 years 4 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...