CAEPIA
2003
Springer
14 years 4 months ago
2003
Springer
The Partitioning problem is a key issue in the design of Distributed Virtual Environment (DVE) systems based on a server-network architecture. This problem consist of efficiently ...
ICRA
2003
IEEE
14 years 4 months ago
2003
IEEE
— This paper addresses the problem of simultaneous localization and mapping (SLAM) by a mobile robot. The SLAM problem is defined as a global optimization problem in which the o...
ICDAR
2003
IEEE
14 years 4 months ago
2003
IEEE
Classifying an unknown input is a fundamental problem in pattern recognition. A common method is to define a distance metric between patterns and find the most similar pattern i...
ENC
2003
IEEE
14 years 4 months ago
2003
IEEE
We discuss a set of metrics, which aims to facilitate the formation of symbol groups from a pseudoergodic information source. An optimal codification can then be applied on the sy...
EH
2003
IEEE
14 years 4 months ago
2003
IEEE
This paper describes a technique for evolving similar solutions to similar configuration design problems. Using the configuration design of combination logic circuits as a testb...
EH
2003
IEEE
14 years 4 months ago
2003
IEEE
In this paper, we perform a comparative study of different heuristics used to design combinational logic circuits. The use of local search hybridized with a genetic algorithm and ...
DSD
2003
IEEE
14 years 4 months ago
2003
IEEE
Network on Chip (NoC) is a new paradigm for designing core based System on Chip which supports high degree of reusability and is scalable. In this paper we describe an efficient t...
CSMR
2003
IEEE
14 years 4 months ago
2003
IEEE
There may be several reasons to reduce a software system to its bare bone removing the extra fat introduced during development or evolution. Porting the software system on embedde...
CSB
2003
IEEE
14 years 4 months ago
2003
IEEE
Physical map reconstruction in the presence of errors is a central problem in genetics of high computational complexity. A parallel genetic algorithm for a maximum likelihood esti...
SGAI
2004
Springer
14 years 4 months ago
2004
Springer
In Wrapper based feature selection, the more states that are visited during the search phase of the algorithm the greater the likelihood of finding a feature subset that has a high...