Sciweavers

137 search results - page 11 / 28
» On the number of local minima for the multidimensional assig...
Sort
View
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 7 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 1 months ago
Central Point Crossover for Neuro-genetic Hybrids
In this paper, we consider each neural network as a point in a multi-dimensional problem space and suggest a crossover that locates the central point of a number of neural networks...
Soonchul Jung, Byung Ro Moon
DAWAK
2005
Springer
14 years 1 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
COMCOM
2010
131views more  COMCOM 2010»
13 years 6 months ago
Level the buffer wall: Fair channel assignment in wireless sensor networks
—In this paper, we study the trade-off between network throughput and fairness in a multi-channel enabled WSN. Traditional approaches attempt to solve the two problems in an isol...
Yanyan Yang, Yunhuai Liu, Lionel M. Ni
PODC
2010
ACM
13 years 11 months ago
Brief announcement: complexity and solution of the send-receive correlation problem
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
Benito van der Zander, Egon Wanke, Wolfgang Kie&sz...