185 search results - page 5 / 37 » Local Algorithms for Finding Interesting Individuals in Larg... |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
TAINN
2005
Springer
14 years 1 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
—In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participatin...
P2PKM
2004
13 years 9 months ago
2004
We present RDFGrowth, an algorithm that addresses a specific yet important scenario: large scale, end user targeted, metadata exchange P2P applications. In this scenario, peers per...
LCN
2002
IEEE
14 years 19 days ago
2002
IEEE
There is growing interest in wireless personal area networks built from portable devices equipped with shortrange radio interfaces such as Bluetooth. These small networks (called ...