1688 search results - page 186 / 338 » Implementing Optimizations at Decode Time |
104
click to vote
EUROGP
2001
Springer
15 years 6 months ago
2001
Springer
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...
104
Voted
EUROGP
2000
Springer
15 years 6 months ago
2000
Springer
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...
108
Voted
INFOCOM
1991
IEEE
15 years 5 months ago
1991
IEEE
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...
113
click to vote
PLDI
2010
ACM
15 years 7 months ago
2010
ACM
Arrays are the ubiquitous organization for indexed data. Throughout programming language evolution, implementations have laid out arrays contiguously in memory. This layout is pro...
144
click to vote
AI
2010
Springer
15 years 2 months ago
2010
Springer
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...