10988 search results - page 509 / 2198 » Algorithmic Folding Complexity |
191
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
182
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
Background subtraction is an essential element in most object tracking and video surveillance systems. The success of this low-level processing step is highly dependent on the qua...
207
click to vote
ITNG
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents several parallel FFT algorithms with different degree of communication overhead for multiprocessors in Network-on-Chip(NoC) environment. Three different method...
167
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Over the recent years, there has been increasing research activities made on improving the efficacy of Memetic Algorithm (MA) for solving complex optimization problems. Partic...
169
Voted
CP
2007
Springer
16 years 1 months ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...