Sciweavers

184 search results - page 18 / 37
» Using FPGAs to solve the Hamiltonian cycle problem
Sort
View
SAC
2010
ACM
15 years 6 months ago
MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
David Portugal, Rui Rocha
ATAL
2008
Springer
15 years 1 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
EC
1998
112views ECommerce» more  EC 1998»
14 years 11 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
IAT
2005
IEEE
15 years 5 months ago
Using Similarity Measures for an Efficient Business Information-Exchange
Several problems are involved in the Virtual Enterprise (VE) formation process. One of the most important problems is the lack of understanding that may arise during agents’ int...
Andreia Malucelli, Eugénio C. Oliveira
TVLSI
1998
123views more  TVLSI 1998»
14 years 11 months ago
On-line fault detection for bus-based field programmable gate arrays
Abstract—We introduce a technique for on-line built-in selftesting (BIST) of bus-based field programmable gate arrays (FPGA’s). This system detects deviations from the intende...
N. R. Shnidman, William H. Mangione-Smith, Miodrag...