48 search results - page 9 / 10 » An Average Analysis of Backtracking on Random Constraint Sat... |
WIOPT
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— In a dense multi-hop network of mobile nodes capable of applying adaptive power control, we consider the problem of finding the optimal hop distance that maximizes a c...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
85
Voted
CIKM
2011
Springer
13 years 9 months ago
2011
Springer
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
95
Voted
WICOMM
2010
14 years 8 months ago
2010
The rapid proliferation of wireless systems makes interference management more and more important. This paper presents a novel cognitive coexistence framework, which enables an in...