200 search results - page 11 / 40 » What Graphs can be Efficiently Represented by BDDs |
HEURISTICS
2006
13 years 7 months ago
2006
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract-- In this paper we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for thi...
ESWS
2009
Springer
13 years 5 months ago
2009
Springer
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
SCOPES
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Abstract-- Communications between individuals can be represented by (weighted, multi-) graphs. Many applications operate on communication graphs associated with telephone calls, em...