1421 search results - page 217 / 285 » Satisfying KBO Constraints |
304
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
155
click to vote
VLSID
2007
IEEE
16 years 6 months ago
2007
IEEE
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...
130
click to vote
VLSID
2002
IEEE
16 years 6 months ago
2002
IEEE
Interconnect with an insufficient width may be subject to electromigration and eventually cause the failure of the circuit at any time during its lifetime. This problem has gotten...
277
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
239
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Tools for generating test queries for databases do not explicitly take into account the actual data in the database. As a consequence, such tools cannot guarantee suitable coverag...