Sciweavers

17760 search results - page 344 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
SPAA
1990
ACM
15 years 11 months ago
Parallel Algorithms for Arrangements
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
Richard J. Anderson, Paul Beame, Erik Brisson
ATAL
2008
Springer
15 years 8 months ago
Decentralized algorithms for collision avoidance in airspace
The paper proposes decentralized deconfliction algorithms deployed on multiple autonomous aerial vehicles in freeflight operations. The paper provides two separate algorithms for ...
David Sislák, Jiri Samek, Michal Pechoucek
161
Voted
AAAI
2006
15 years 8 months ago
Optimal Scheduling of Contract Algorithms for Anytime Problems
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
Alejandro López-Ortiz, Spyros Angelopoulos,...
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
15 years 8 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 8 months ago
Introducing MONEDA: scalable multiobjective optimization with a neural estimation of distribution algorithm
In this paper we explore the model–building issue of multiobjective optimization estimation of distribution algorithms. We argue that model–building has some characteristics t...
Luis Martí, Jesús García, Ant...