7421 search results - page 1272 / 1485 » In search of dependable design |
191
click to vote
C3S2E
2010
ACM
15 years 7 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
160
click to vote
CCCG
2009
15 years 7 months ago
2009
Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper, we propose algorithms to enumerate polyominoes for p4 tiling...
141
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper, we introduce a new image database, consisting of examples of artists' work. Successful classification of this database suggests the capacity to automatically re...
160
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
187
click to vote
CLEF
2009
Springer
15 years 7 months ago
2009
Springer
This paper describes the participation of the Technical University of Catalonia in the CLEF 2009 Question Answering on Speech Transcripts track. We have participated in the Englis...