601 search results - page 118 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
113
click to vote
TCAD
2008
14 years 11 months ago
2008
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
122
click to vote
EJWCN
2010
14 years 6 months ago
2010
We formulate the problem of distributed throughput-efficient sensing in cognitive radio (CR) networks as a dynamic coalition formation game based on a Markovian model. The propose...
DAC
2002
ACM
16 years 22 days ago
2002
ACM
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
120
click to vote
PERCOM
2005
ACM
15 years 11 months ago
2005
ACM
Unique and challenging security problems arise due to the scarcity of computational, storage, and power resources in the low-cost pervasive computing environment. Particularly rel...
116
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Recent attention in quickest change detection in the multi-sensor setting has been on the case where the densities of the observations change at the same instant at all the sensor...