Sciweavers

48 search results - page 9 / 10
» An Average Analysis of Backtracking on Random Constraint Sat...
Sort
View
WIOPT
2006
IEEE
14 years 2 months ago
Capacity optimizing hop distance in a mobile ad hoc network with power control
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...
Dinesh Kumar 0002, Venkatesh Ramaiyan, Anurag Kuma...
CORR
2006
Springer
125views Education» more  CORR 2006»
13 years 8 months ago
Barriers and local minima in energy landscapes of stochastic local search
: 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 ...
Petteri Kaski
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 8 months ago
Typical properties of winners and losers in discrete optimization
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...
René Beier, Berthold Vöcking
CIKM
2011
Springer
12 years 8 months ago
Lower-bounding term frequency normalization
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;...
Yuanhua Lv, ChengXiang Zhai
WICOMM
2010
91views more  WICOMM 2010»
13 years 6 months ago
A sensing-based cognitive coexistence method for interfering infrastructure and ad hoc systems
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...
Stefan Geirhofer, Lang Tong, Brian M. Sadler