Sciweavers

4074 search results - page 558 / 815
» Defining Computational Aesthetics
Sort
View
COMGEO
1999
ACM
15 years 6 months ago
Point labeling with sliding labels
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
JMMA
2002
90views more  JMMA 2002»
15 years 6 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...
SAC
2002
ACM
15 years 6 months ago
Dynamically generating web application fragments from page templates
Web-based applications are typically required to be highly customizable and configurable. New application requirements have to be introduced rapidly, often without stopping the ru...
Uwe Zdun
TCS
2002
15 years 6 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
TEC
2002
101views more  TEC 2002»
15 years 6 months ago
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principl...
Kuk-Hyun Han, Jong-Hwan Kim