Sciweavers

811 search results - page 30 / 163
» An efficient algorithm for the configuration problem of domi...
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
A combined genetic-neural algorithm for mobility management
This work presents a new approach to solve the location management problem by using the location areas approach. A combination of a genetic algorithm and the Hopfield neural netwo...
Javid Taheri, Albert Y. Zomaya
JSS
2010
104views more  JSS 2010»
13 years 2 months ago
Using hybrid algorithm for Pareto efficient multi-objective test suite minimisation
Test suite minimisation techniques seek to reduce the effort required for regression testing by selecting a subset of test suites. In previous work, the problem has been considere...
Shin Yoo, Mark Harman
DIMACS
2001
13 years 9 months ago
Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons
Abstract. One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family o...
Ileana Streinu
IPL
2010
158views more  IPL 2010»
13 years 4 months ago
Finding bipartite subgraphs efficiently
Polynomial algorithms are given for the following two problems:
Dhruv Mubayi, György Turán
IPPS
1999
IEEE
13 years 12 months ago
Oblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton