4117 search results - page 475 / 824 » On the Satisfiability of Complex Constraints |
157
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—The problem of maximizing the sum of the transmit rates while limiting the outage probability below an appropriate threshold is investigated for networks where the nodes have li...
226
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
— We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple re...
193
click to vote
TOOLS
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract. A popular approach to compositional verification of component-based applications is based on the assume-guarantee paradigm, where an assumption models behavior of an env...
197
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
160
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— We address the problem of scheduling multiple traffic streams associated with target profiles on a shared wireless link, arising in real-time applications with soft/flexible...