Sciweavers

9325 search results - page 262 / 1865
» The decentralized implementability problem
Sort
View
AES
2007
Springer
92views Cryptology» more  AES 2007»
15 years 4 months ago
MicroARTMAP for pattern recognition problems
Pattern recognition is an important aspect of a dominant technology such as machine intelligence. Domain specific fuzzy-neuro models particularly for the ‘black box’ implemen...
Sundaramoorthy Rajasekaran, Vasantha Kalyani David
COR
2006
122views more  COR 2006»
15 years 4 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
15 years 4 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
MP
1998
117views more  MP 1998»
15 years 3 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...
CDC
2010
IEEE
14 years 11 months ago
Synthesis using approximately bisimilar abstractions: time-optimal control problems
s using Approximately Bisimilar Abstractions: Time-Optimal Control Problems Antoine Girard In this paper, we present a hierarchical approach to time-optimal control using approxima...
Antoine Girard