7986 search results - page 397 / 1598 » Computational Science and its Applications |
165
click to vote
ACMSE
2006
ACM
16 years 24 days ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
176
click to vote
ACSC
2003
IEEE
16 years 3 days ago
2003
IEEE
In this paper, we present several general policies for deciding when to share probabilistic beliefs between agents for distributed monitoring. In order to evaluate these policies,...
171
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
196
click to vote
GI
2009
Springer
15 years 4 months ago
2009
Springer
Abstract: One of the basic tasks of automotive collision avoidance and collision mitigation systems is the robust and reliable detection of objects as well as the prediction of fut...
191
click to vote
IEEESCC
2007
IEEE
16 years 1 months ago
2007
IEEE
A common pattern in scientific computing involves the execution of many tasks that are coupled only in the sense that the output of one may be passed as input to one or more other...