4524 search results - page 600 / 905 » The Complexity of Global Constraints |
204
click to vote
CINQ
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
182
click to vote
ATAL
2006
Springer
15 years 11 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
194
click to vote
DATE
2004
IEEE
15 years 11 months ago
2004
IEEE
Many high-end DSP processors employ both multiple memory banks and heterogeneous register files to improve performance and power consumption. The complexity of such architectures ...
214
click to vote
CPAIOR
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC) platforms. We propose a methodology to ...
207
click to vote
DAWAK
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...