1013 search results - page 120 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
123
click to vote
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
104
click to vote
CEC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—While scalarization approaches to multicriteria optimization become infeasible in the case of many objectives, for few objectives the benefits of populationbased method...
105
click to vote
UIST
2006
ACM
15 years 7 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
114
click to vote
CMSB
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. The important research objective of identifying genes with similar behavior with respect to different conditions has recently been tackled with biclustering techniques. I...
115
click to vote
SAC
2009
ACM
15 years 6 months ago
2009
ACM
Experimental studies have shown that electing a leader based on measurements of the underlying communication network can be beneficial. We use this approach to study the problem ...