Sciweavers

4171 search results - page 757 / 835
» Choice numbers of graphs
Sort
View
EGH
2004
Springer
15 years 10 months ago
Efficient partitioning of fragment shaders for multiple-output hardware
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
Tim Foley, Mike Houston, Pat Hanrahan
DGCI
2006
Springer
15 years 10 months ago
A Network Flow Algorithm for Binary Image Reconstruction from Few Projections
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
Kees Joost Batenburg
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
15 years 10 months ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde
ACSAC
2001
IEEE
15 years 10 months ago
Information Flow Analysis of Component-Structured Applications
Software component technology facilitates the costeffective development of specialized applications. Nevertheless, due to the high number of principals involved in a component-str...
Peter Herrmann
EKAW
2000
Springer
15 years 10 months ago
KIDS: An Iterative Algorithm to Organize Relational Knowledge
The goal of conceptual clustering is to build a set of embedded classes, which cluster objects based on their similarities. Knowledge organization aims at generating the set of mos...
Isabelle Bournaud, Mélanie Courtine, Jean-D...