Sciweavers

474 search results - page 26 / 95
» Computing integral solutions of complementarity problems
Sort
View
IPPS
2010
IEEE
14 years 7 months ago
A PRAM-NUMA model of computation for addressing low-TLP workloads
It is possible to implement the parallel random access machine (PRAM) on a chip multiprocessor (CMP) efficiently with an emulated shared memory (ESM) architecture to gain easy par...
Martti Forsell
DISCO
1993
156views Hardware» more  DISCO 1993»
15 years 1 months ago
Variant Handling, Inheritance and Composition in the ObjectMath Computer Algebra Environment
ObjectMath is a high-level programming environment and modeling language for scientific computing which supports variants and graphical browsing in the environment and integrates o...
Peter Fritzson, Vadim Engelson, Lars Viklund
AAAI
2007
15 years 2 days ago
Approximate Counting by Sampling the Backtrack-free Search Space
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently...
Vibhav Gogate, Rina Dechter
JMLR
2010
115views more  JMLR 2010»
14 years 8 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
IWCMC
2006
ACM
15 years 3 months ago
Resolving islands of security problem for DNSSEC
The DNS Security Extensions (DNSSEC) were developed to add origin authentication and integrity. DNSSEC defined a public key infrastructure over DNS tree hierarchy for the public ...
Eunjong Kim, Ashish Gupta, Batsukh Tsendjav, Danie...