Sciweavers

3134 search results - page 488 / 627
» Computing full disjunctions
Sort
View
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
14 years 3 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 3 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
GECCO
2010
Springer
159views Optimization» more  GECCO 2010»
14 years 3 months ago
Evolution of division of labor in genetically homogenous groups
Within nature, the success of many organisms, including certain species of insects, mammals, slime molds, and bacteria, is attributed to their performance of division of labor, wh...
Heather Goldsby, David B. Knoester, Charles Ofria
MM
2009
ACM
187views Multimedia» more  MM 2009»
14 years 2 months ago
Convex experimental design using manifold structure for image retrieval
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
Lijun Zhang, Chun Chen, Wei Chen, Jiajun Bu, Deng ...
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
14 years 2 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux