1243 search results - page 180 / 249 » Complexity reduction of C-Algorithm |
117
click to vote
GLVLSI
2009
IEEE
15 years 8 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
106
click to vote
ICASSP
2009
IEEE
15 years 8 months ago
2009
IEEE
Copy-move forgery is a specific type of image tampering, where a part of the image is copied and pasted on another part of the same image. In this paper, we propose a new approac...
124
click to vote
ICDAR
2009
IEEE
15 years 8 months ago
2009
IEEE
Character prototype approaches for writer identification produces a consistent set of templates that are used to model the handwriting styles of writers, thereby allowing high acc...
123
click to vote
ALDT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
108
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...