Sciweavers

5889 search results - page 384 / 1178
» Graph Layout Problems
Sort
View
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
15 years 11 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
CIKM
2009
Springer
15 years 10 months ago
Semantic queries in databases: problems and challenges
Supporting semantic queries in relational databases is essential to many advanced applications. Recently, with the increasing use of ontology in various applications, the need for...
Lipyeow Lim, Haixun Wang, Min Wang
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 7 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
SDM
2011
SIAM
284views Data Mining» more  SDM 2011»
14 years 9 months ago
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...
Myunghwan Kim 0002, Jure Leskovec
ICPR
2008
IEEE
16 years 1 months ago
An approach for video cut detection using bipartite graph matching as dissimilarity distance
The video segmentation problem consists in the identification of the boundary between consecutive shots. When two consecutive frames are similar, they are considered to be in the...
Silvio Jamil Ferzoli Guimarães, Zenilton Kl...