Sciweavers

598 search results - page 39 / 120
» The Puzzle Layout Problem
Sort
View
TVCG
2012
182views Hardware» more  TVCG 2012»
11 years 10 months ago
Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction
—We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach uti...
Kun-Chuan Feng, Chaoli Wang, Han-Wei Shen, Tong-Ye...
MP
1998
117views more  MP 1998»
13 years 7 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
GECCO
2005
Springer
103views Optimization» more  GECCO 2005»
14 years 1 months ago
Pricing the 'free lunch' of meta-evolution
A number of recent studies introduced meta-evolutionary strategies and successfully used them for solving problems in genetic programming. While individual results indicate possib...
Alexei V. Samsonovich, Kenneth A. De Jong
MFCS
2001
Springer
14 years 22 hour ago
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
Erik D. Demaine
CCCG
2008
13 years 9 months ago
Partial Matching of Planar Polygons Under Translation and Rotation
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...
Eric McCreath