Sciweavers

756 search results - page 22 / 152
» A new algorithm for Boolean operations on general polygons
Sort
View
PPSN
2010
Springer
13 years 6 months ago
A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for...
Darrell Whitley, Doug Hains, Adele E. Howe
ATAL
2010
Springer
13 years 9 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
SAC
2011
ACM
12 years 10 months ago
New hybrid genetic algorithm for solving optimal communication spanning tree problem
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
Pham Trung Kien, Nguyen Duy Hiep, Huynh Thi Thanh ...
IANDC
2008
114views more  IANDC 2008»
13 years 8 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
MMM
2003
Springer
258views Multimedia» more  MMM 2003»
14 years 1 months ago
2D Shape Transformation Using 3D Blending
Computer animation is one of the key components of a multimedia document or presentation. Shape transformation between objects of different topology and positions is an open model...
Galina Pasko, Alexander A. Pasko, M. Ikeda, Tosiya...