Sciweavers

193 search results - page 18 / 39
» Several ways to solve the MSO problem
Sort
View
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
15 years 3 months ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen
SOFSEM
2000
Springer
15 years 1 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
COLT
2003
Springer
15 years 3 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
GECCO
2006
Springer
116views Optimization» more  GECCO 2006»
15 years 1 months ago
A crossover for complex building blocks overlapping
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
SCHEDULING
2010
104views more  SCHEDULING 2010»
14 years 4 months ago
A fluid approach to large volume job shop scheduling
We consider large volume job shop scheduling problems, in which there is a fixed number of machines, a bounded number of activities per job, and a large number of jobs. In large v...
Yoni Nazarathy, Gideon Weiss