531 search results - page 79 / 107 » A Better Algorithm for Random k-SAT |
ICASSP
2011
IEEE
13 years 23 days ago
2011
IEEE
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
SIAMCOMP
2000
13 years 8 months ago
2000
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...