6142 search results - page 281 / 1229 » The Complexity of Partition Functions |
204
click to vote
DAC
2004
ACM
15 years 10 months ago
2004
ACM
This paper presents new technology that accelerates system verification. Traditional methods for verifying functional designs are based on logic simulation, which becomes more tim...
158
click to vote
VLDB
1987
ACM
15 years 9 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
184
click to vote
QUESTA
2007
15 years 5 months ago
2007
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to inve...
160
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper studies stabilization of polytopic delay difference inclusions via the Razumikhin approach. An example of a linear delay difference equation that is globally exponential...
147
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...