Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
EJWCN
2010
115views more  EJWCN 2010»
12 years 21 days ago
Efficient Certification Path Discovery for MANET
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
Georgios Kambourakis, Elisavet Konstantinou, Anast...
COMSIS
2010
12 years 3 months ago
Generative 3D images in a visual evolutionary computing system
This paper presents a novel computer-aided design system which uses a computational approach to producing 3D images for stimulating creativity of designers. It introduces the genet...
Hong Liu
CG
2006
Springer
12 years 5 months ago
Shape reasoning and understanding
s: clustering, denoising, sharp feature, shape abstraction, reverse engineering In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fit...
Bianca Falcidieno, Remco C. Veltkamp
CIC
2006
111views Communications» more  CIC 2006»
12 years 7 months ago
A New Tree-based Tag Anti-collision Protocol for RFID Systems
Abstract-- This paper proposes a tree-based anti-collision protocol for tags in the UHF (ultra high frequency, 300MHz
Sung Hyun Kim, Min Kyo Shin, PooGyeon Park
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
12 years 9 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster
PG
2002
IEEE
12 years 10 months ago
A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...
Ioannis P. Ivrissimtzis, Christian Rössl, Han...
APLAS
2003
ACM
12 years 11 months ago
Rebuilding a Tree from Its Traversals: A Case Study of Program Inversion
Given the inorder and preorder traversal of a binary tree whose labels are all distinct, one can reconstruct the tree. This article examines two existing algorithms for rebuilding ...
Shin-Cheng Mu, Richard S. Bird
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
12 years 11 months ago
Optimization of Constructive Solid Geometry Via a Tree-Based Multi-objective Genetic Algorithm
This paper presents the multi-objective evolutionary optimization of three-dimensional geometry represented via constructive solid geometry (CSG), a binary tree of boolean operatio...
Karim Hamza, Kazuhiro Saitou
GECCO
2004
Springer
12 years 11 months ago
Schema Disruption in Chromosomes That Are Structured as Binary Trees
We are interested in schema disruption behavior when chromosomes are structured as binary trees. We give the deļ¬nition of the disruption probability dp(H) of a schema H, and also...
William A. Greene
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
12 years 11 months ago
Genetic drift in univariate marginal distribution algorithm
Like Darwinian-type genetic algorithms, there also exists genetic drift in Univariate Marginal Distribution Algorithm (UMDA). Since the universal analysis of genetic drift in UMDA...
Yi Hong, Qingsheng Ren, Jin Zeng
books