34170 search results - page 745 / 6834 » Optimization |
221
click to vote
FPL
2004
Springer
15 years 11 months ago
2004
Springer
We describe algorithmic results for two crucial aspects of allocating resources on computational hardware devices with partial reconfigurability. By using methods from the field of...
194
click to vote
ECAI
2006
Springer
15 years 11 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
181
click to vote
EDBTW
2006
Springer
15 years 11 months ago
2006
Springer
The wavelet decomposition is a proven tool for constructing concise synopses of massive data sets and rapid changing data streams, which can be used to obtain fast approximate, wit...
193
click to vote
ESA
2006
Springer
15 years 11 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
176
click to vote
FSTTCS
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. In this paper we construct fixed finite tile systems that assemble into particular classes of shapes. Moreover, given an arbitrary n, we show how to calculate the tile co...