10146 search results - page 1633 / 2030 » Fast FAST |
195
Voted
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...
175
Voted
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
In modern racing games programming non-player characters with believable and sophisticated behaviors is getting increasingly challenging. Recently, several works in the literature ...
198
Voted
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Classification problems in critical applications such as health care or security often require very high reliability because of the high costs of errors. In order to achieve this r...
179
click to vote
CIIA
2009
15 years 7 months ago
2009
In this paper, we present a new synthesis feature namely, "Xor matching", and the foldback product term synthesis for Complex Programmable Logic Devices (CPLD) architectu...
217
Voted
DEXAW
2010
IEEE
15 years 7 months ago
2010
IEEE
Automatic generation of taxonomies can be useful for a wide area of applications. In our application scenario a topical hierarchy should be constructed reasonably fast from a large...