248 search results - page 25 / 50 » The Multi-Story Space Assignment Problem |
106
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Designing technical plants is a complex and demanding process. It has been shown that the optimization of the simple facility placement problem is already NP-hard. Optimization of...
163
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
124
Voted
LKR
2008
15 years 3 months ago
2008
Abstract. For clustering problems, many studies use just MAP assignments to show clustering results instead of using whole samples from a MCMC sampler. This is because it is not st...
121
click to vote
CACM
2010
15 years 2 months ago
2010
Data represented geometrically in high-dimensional vector spaces can be found in many applications. Images and videos, are often represented by assigning a dimension for every pix...
119
Voted
ISLPED
2010
ACM
15 years 2 months ago
2010
ACM
The ongoing scaling of semiconductor technology is causing severe increase of on-chip power density and temperature in microprocessors. This has raised urgent requirement for both...