Sciweavers

4908 search results - page 410 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
DATE
2008
IEEE
78views Hardware» more  DATE 2008»
16 years 1 months ago
Simultaneous FU and Register Binding Based on Network Flow Method
– With the rapid increase of design complexity and the decrease of device features in nano-scale technologies, interconnection optimization in digital systems becomes more and mo...
Jason Cong, Junjuan Xu
ICMCS
2008
IEEE
168views Multimedia» more  ICMCS 2008»
16 years 1 months ago
A co-design platform for algorithm/architecture design exploration
The efficient implementation of multimedia algorithms, for the ever increasing complexity of the specifications and the emergence of the new generation of processing platforms c...
Christophe Lucarz, Marco Mattavelli, Julien Dubois
IPPS
2008
IEEE
16 years 1 months ago
A study of master-slave approaches to parallelize NSGA-II
Many of the optimization problems from the real world are multiobjective in nature, and the reference algorithm for multiobjective optimization is NSGA-II. Frequently, these probl...
Juan José Durillo, Antonio J. Nebro, Franci...
RTSS
2008
IEEE
16 years 1 months ago
Fast Sensor Placement Algorithms for Fusion-Based Target Detection
Mission-critical target detection imposes stringent performance requirements for wireless sensor networks, such as high detection probabilities and low false alarm rates. Data fus...
Zhaohui Yuan, Rui Tan, Guoliang Xing, Chenyang Lu,...
GECCO
2007
Springer
136views Optimization» more  GECCO 2007»
16 years 1 months ago
Do additional objectives make a problem harder?
In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experime...
Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus...