Sciweavers

400 search results - page 23 / 80
» Hard Problem Generation for MKP
Sort
View
ISSS
1995
IEEE
96views Hardware» more  ISSS 1995»
15 years 7 months ago
Time-constrained code compaction for DSPs
{DSP algorithms in most cases are subject to hard real-time constraints. In case of programmable DSP processors, meeting those constraints must be ensured by appropriate code gener...
Rainer Leupers, Peter Marwedel
105
Voted
ICANN
2009
Springer
15 years 10 months ago
Almost Random Projection Machine
Backpropagation of errors is not only hard to justify from biological perspective but also it fails to solve problems requiring complex logic. A simpler algorithm based on generati...
Wlodzislaw Duch, Tomasz Maszczyk
TSE
2010
235views more  TSE 2010»
14 years 10 months ago
DECOR: A Method for the Specification and Detection of Code and Design Smells
Abstract-- Code and design smells are poor solutions to recurring implementation and design problems. They may hinder the evolution of a system by making it hard for software engin...
Naouel Moha, Yann-Gaël Guéhéneu...
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 11 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
137
Voted
CGVR
2006
15 years 5 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Michael Boehl, Wolfgang Stürzlinger