3220 search results - page 407 / 644 » Constrained Graph Processes |
155
click to vote
SAT
2007
Springer
16 years 18 days ago
2007
Springer
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
173
click to vote
CCECE
2006
IEEE
16 years 17 days ago
2006
IEEE
The goal of this paper is to present a new recipe for the fractal image decoding process. In this paper, we explain how fractal-based methods can be internally combined with regul...
184
click to vote
GLOBECOM
2006
IEEE
16 years 17 days ago
2006
IEEE
— This paper addresses learning based adaptive resource allocation for wireless MIMO channels with Markovian fading. The problem is posed as Constrained Markov Decision Process w...
177
click to vote
INFOCOM
2006
IEEE
16 years 16 days ago
2006
IEEE
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...
158
click to vote
ISCAS
2006
IEEE
16 years 16 days ago
2006
IEEE
— All-solution Boolean satisfiability (SAT) solvers are engines employed to find all the possible solutions to a SAT problem. Their applications are found throughout the EDA in...