Sciweavers

12825 search results - page 1963 / 2565
» Improved PLSOM algorithm
Sort
View
CW
2004
IEEE
15 years 11 months ago
Interactive Point-Based Painterly Rendering
Non-photo realistic rendering (NPR) methods have been proposed for more than ten years in the Computer Graphic field. Separately, within past few years, several algorithms for ren...
Hiroaki Kawata, Alexandre Gouaillard, Takashi Kana...
ESA
2006
Springer
147views Algorithms» more  ESA 2006»
15 years 10 months ago
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
ESTIMEDIA
2006
Springer
15 years 10 months ago
Neighbors-on-Path: A New Selection Strategy for On-Chip Networks
Efficient and deadlock-free routing is critical to the performance of networks-on-chip. In this paper we present an approach that can be coupled to any adaptive routing algorithm ...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi,...
EVOW
2006
Springer
15 years 10 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 10 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
« Prev « First page 1963 / 2565 Last » Next »