Sciweavers

11211 search results - page 1795 / 2243
» Data Structures
Sort
View
ENC
2006
IEEE
15 years 10 months ago
Adaptive Node Refinement Collocation Method for Partial Differential Equations
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...
José Antonio Muñoz-Gómez, Ped...
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 10 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
AICCSA
2001
IEEE
95views Hardware» more  AICCSA 2001»
15 years 10 months ago
An Environment Physically Distributed in Java
- This paper presents an environment for development of distributed applications. It consists basically of adding to language Java a library of methods to manipulate shared objects...
Denivaldo Lopes, Zair Abdelouahab
EDBT
2000
ACM
15 years 10 months ago
Mining Classification Rules from Datasets with Large Number of Many-Valued Attributes
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
Giovanni Giuffrida, Wesley W. Chu, Dominique M. Ha...
RTCSA
2000
IEEE
15 years 10 months ago
Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information
A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor systems is presented in this paper. The commonly used method to implement share...
Håkan Sundell, Philippas Tsigas
« Prev « First page 1795 / 2243 Last » Next »