2989 search results - page 88 / 598 » Using Domain-Independent Problems for Introducing Formal Met... |
DAC
2005
ACM
15 years 10 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
SAS
2007
Springer
15 years 3 months ago
2007
Springer
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacer...
PR
2010
14 years 8 months ago
2010
Most existing representative works in semi-supervised clustering do not sufficiently solve the violation problem of pairwise constraints. On the other hand, traditional kernel met...
ICDM
2007
IEEE
15 years 4 months ago
2007
IEEE
The problem of transfer learning, where information gained in one learning task is used to improve performance in another related task, is an important new area of research. While...
AAAI
2004
14 years 11 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...