Sciweavers

1688 search results - page 186 / 338
» Implementing Optimizations at Decode Time
Sort
View
EUROGP
2001
Springer
14 years 24 days ago
A GP Artificial Ant for Image Processing: Preliminary Experiments with EASEA
This paper describes how animat-based “food foraging” techniques may be applied to the design of low-level image processing algorithms. First, we show how we implemented the fo...
Enzo Bolis, Christian Zerbi, Pierre Collet, Jean L...
EUROGP
2000
Springer
116views Optimization» more  EUROGP 2000»
13 years 12 months ago
An Extrinsic Function-Level Evolvable Hardware Approach
1 The function level evolvable hardware approach to synthesize the combinational multiple-valued and binary logic functions is proposed in rst time. The new representation of logic...
Tatiana Kalganova
INFOCOM
1991
IEEE
13 years 11 months ago
On Multicast Path Finding Algorithms
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuri...
Ching-Hua Chow
PLDI
2010
ACM
14 years 1 months ago
Z-rays: divide arrays and conquer speed and flexibility
Arrays are the ubiquitous organization for indexed data. Throughout programming language evolution, implementations have laid out arrays contiguously in memory. This layout is pro...
Jennifer B. Sartor, Stephen M. Blackburn, Daniel F...
AI
2010
Springer
13 years 8 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...