Sciweavers

1688 search results - page 180 / 338
» Implementing Optimizations at Decode Time
Sort
View
DATE
1997
IEEE
80views Hardware» more  DATE 1997»
14 years 16 days ago
Hybrid symbolic-explicit techniques for the graph coloring problem
This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the...
Silvia Chiusano, Fulvio Corno, Paolo Prinetto, Mat...
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
14 years 1 months ago
Adaptive and Evolvable Network Services
This paper proposes an evolutionary framework where a network service is created from a group of autonomous agents that interact and evolve. Agents in our framework are capable of ...
Tadashi Nakano, Tatsuya Suda
EOR
2006
61views more  EOR 2006»
13 years 8 months ago
Workload minimization in re-entrant lines
This paper is concerned with workload minimization in re-entrant lines with exponential service times and preemptive control policies. Using a numerical algorithm called the power...
Ger Koole, Auke Pot
COR
2008
102views more  COR 2008»
13 years 7 months ago
An algorithm for ranking assignments using reoptimization
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
ICASSP
2011
IEEE
13 years 1 days ago
On spatio-temporal Tomlinson Harashima Precoding in IIR channels: MMSE solution, properties, and fast computation
We consider spatio-temporal Tomlinson Harashima Precoding where the feedforward filter is located at the transmitter and an additional scalar gain is employed as receive filter....
Sander Wahls, Holger Boche