738 search results - page 121 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
AC
1998
Springer
14 years 9 months ago
1998
Springer
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
108
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
IMR
2005
Springer
15 years 3 months ago
2005
Springer
The first stage in an adaptive finite element scheme (cf. [CAS95, bor1]) consists in creating an initial mesh of a given domain Ω, which is used to perform an initial computati...
195
Voted
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
COR
2007
14 years 9 months ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...