Sciweavers

401 search results - page 23 / 81
» Algorithms for a Simple Point Placement Problem
Sort
View
HEURISTICS
2010
14 years 9 months ago
A metaheuristic approach to the urban transit routing problem
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
Lang Fan, Christine L. Mumford
CORR
2010
Springer
146views Education» more  CORR 2010»
14 years 12 months ago
Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...
Daniel Golovin, Andreas Krause
CG
2007
Springer
14 years 11 months ago
Deferred blending: Image composition for single-pass point rendering
In this paper, we propose novel GPU accelerated algorithms for interactive point-based rendering (PBR) and high-quality shading of transparent point surfaces. By introducing the c...
Yanci Zhang, Renato Pajarola
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 5 months ago
EA models and population fixed-points versus mutation rates for functions of unitation
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
J. Neal Richter, John Paxton, Alden H. Wright
COMSIS
2010
14 years 9 months ago
3D point pattern matching based on spatial geometric flexibility
We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises...
Xiaopeng Wei, Xiaoyong Fang, Qiang Zhang, Dongshen...