Sciweavers

7006 search results - page 1048 / 1402
» Approximation Algorithms
Sort
View
COLT
2003
Springer
15 years 12 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
EPIA
2003
Springer
15 years 12 months ago
Evolutionary Neuroestimation of Fitness Functions
Abstract. One of the most influential factors in the quality of the solutions found by an evolutionary algorithm is the appropriateness of the fitness function. Specifically in ...
Jesús S. Aguilar-Ruiz, Daniel Mateos, Domin...
GECCO
2010
Springer
254views Optimization» more  GECCO 2010»
15 years 11 months ago
Evolutionary multi-objective optimization and decision making for selective laser sintering
This paper proposes an integrated approach to arrive at optimal build orientations, simultaneously minimizing surface roughness ‘Ra’ and build time ‘T’, for object manufac...
Nikhil Padhye, Kalyanmoy Deb
ECML
1997
Springer
15 years 11 months ago
Parallel and Distributed Search for Structure in Multivariate Time Series
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
Tim Oates, Matthew D. Schmill, Paul R. Cohen
PLILP
1993
Springer
15 years 10 months ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl
« Prev « First page 1048 / 1402 Last » Next »