Sciweavers

2168 search results - page 173 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
106
Voted
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
15 years 10 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
128
Voted
COR
2006
122views more  COR 2006»
15 years 3 months ago
Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
Tal Shima, Steven J. Rasmussen, Andrew G. Sparks, ...
131
Voted
IPPS
2007
IEEE
15 years 9 months ago
A Comparative Study of Parallel Metaheuristics for Protein Structure Prediction on the Computational Grid
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...
98
Voted
STACS
2005
Springer
15 years 9 months ago
Roundings Respecting Hard Constraints
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
Benjamin Doerr
125
Voted
ICC
2008
IEEE
130views Communications» more  ICC 2008»
15 years 10 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi