805 search results - page 123 / 161 » Combinatorial optimization problems in self-assembly |
147
Voted
CPM
2009
Springer
14 years 10 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
82
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
—The full-complexity soft-input/soft-output (SISO) multiuser detector based on the a posteriori probability (APP) algorithm has a computational complexity growing exponentially w...
ESCIENCE
2006
IEEE
15 years 6 months ago
2006
IEEE
: A relatively new meta-heuristic, known as extremal optimisation (EO), is based on the evolutionary science notion that poorly performing genes of an individual are replaced by ra...
119
Voted
ICAC
2005
IEEE
15 years 6 months ago
2005
IEEE
Large data centers host several application environments (AEs) that are subject to workloads whose intensity varies widely and unpredictably. Therefore, the servers of the data ce...
110
click to vote
CP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...