Sciweavers

202 search results - page 26 / 41
» Counting Distance Permutations
Sort
View
TMC
2010
224views more  TMC 2010»
14 years 11 months ago
Multihop Range-Free Localization in Anisotropic Wireless Sensor Networks: A Pattern-Driven Scheme
—This paper focuses on multihop range-free localization in anisotropic wireless sensor networks. In anisotropic networks, geometric distance between a pair of sensor nodes is not...
Qingjun Xiao, Bin Xiao, Jiannong Cao, Jianping Wan...
EC
2007
118views ECommerce» more  EC 2007»
15 years 22 days ago
Geometric Crossovers for Multiway Graph Partitioning
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly r...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byun...
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
14 years 10 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
99
Voted
COMPSAC
2007
IEEE
15 years 7 months ago
An End-to-end Detection of Wormhole Attack in Wireless Ad-hoc Networks
Wormhole attack is a severe attack in wireless ad-hoc networks. Most of the previous work eliminate the effect of wormhole attack by examining the distance or communication time o...
Xia Wang, Johnny Wong
136
Voted
ECAI
2008
Springer
15 years 2 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...