12950 search results - page 422 / 2590 » On Optimal Timed Strategies |
142
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
177
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
: Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocatio...
180
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
175
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
This paper is concerned with the efficient transmission of scalable compressed images over lossy communication channels. Recent works have proposed several strategies for assignin...
211
click to vote
SASN
2006
ACM
16 years 27 days ago
2006
ACM
Node misbehavior in wireless ad hoc networks leads to sudden unpredictable changes in network topology, resulting in fluctuation of traffic load and capacity for already existin...