Sciweavers

3825 search results - page 208 / 765
» More on pooling spaces
Sort
View
ICCAD
1995
IEEE
90views Hardware» more  ICCAD 1995»
15 years 10 months ago
An optimal algorithm for area minimization of slicing floorplans
The traditional algorithm of Stockmeyer for area minimization of slicing oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
Weiping Shi
COMPGEOM
1994
ACM
15 years 10 months ago
Spheres, Molecules, and Hidden Surface Removal
We devise techniques to manipulate a collection of loosely interpenetrating spheres in threedimensional space. Our study is motivated by the representation and manipulation of mol...
Dan Halperin, Mark H. Overmars
EVOW
2008
Springer
15 years 8 months ago
Compound Particle Swarm Optimization in Dynamic Environments
Adaptation to dynamic optimization problems is currently receiving a growing interest as one of the most important applications of evolutionary algorithms. In this paper, a compoun...
Lili Liu, Dingwei Wang, Shengxiang Yang
CAINE
2008
15 years 8 months ago
A Recursive Hyperspheric Classification Algorithm
This paper presents a novel method for learning from a labeled dataset to accurately classify unknown data. The recursive algorithm, termed Recursive Hyperspheric Classification, ...
Salyer B. Reed, Carl G. Looney, Sergiu Dascalu
UAI
2008
15 years 8 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht