4117 search results - page 624 / 824 » On the Satisfiability of Complex Constraints |
173
click to vote
ASAP
2006
IEEE
15 years 10 months ago
2006
IEEE
State-of-the-art communication standards make extensive use of Turbo codes. The complex and power consuming designs that currently implement the turbo decoder expose the need for ...
176
click to vote
CINQ
2004
Springer
15 years 10 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 ...
156
click to vote
ATAL
2006
Springer
15 years 10 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...
182
click to vote
CPAIOR
2006
Springer
15 years 10 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 ...
181
click to vote
DAWAK
2006
Springer
15 years 10 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...