Sciweavers

5595 search results - page 687 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
FPGA
2007
ACM
119views FPGA» more  FPGA 2007»
16 years 1 months ago
Synthesis of an application-specific soft multiprocessor system
The application-specific multiprocessor System-on-a-Chip is a promising design alternative because of its high degree of flexibility, short development time, and potentially high ...
Jason Cong, Guoling Han, Wei Jiang
IJHPCA
2006
99views more  IJHPCA 2006»
15 years 6 months ago
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always incre...
Lionel Eyraud
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
16 years 13 days ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
16 years 12 days ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
16 years 12 days ago
Identifying valid solutions for the inference of regulatory networks
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. The problem often is multi-modal and therefore appropriate optimi...
Christian Spieth, Felix Streichert, Nora Speer, An...