Sciweavers

254 search results - page 23 / 51
» On the randomized solution of initial value problems
Sort
View
SAT
2007
Springer
81views Hardware» more  SAT 2007»
15 years 3 months ago
Short XORs for Model Counting: From Theory to Practice
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
60
Voted
EH
2003
IEEE
100views Hardware» more  EH 2003»
15 years 3 months ago
Learning for Evolutionary Design
This paper describes a technique for evolving similar solutions to similar configuration design problems. Using the configuration design of combination logic circuits as a testb...
Sushil J. Louis
STOC
2006
ACM
131views Algorithms» more  STOC 2006»
15 years 10 months ago
On maximizing welfare when utility functions are subadditive
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
Uriel Feige
STACS
2010
Springer
15 years 4 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...
AMC
2008
92views more  AMC 2008»
14 years 9 months ago
Explicit multi-step peer methods for special second-order differential equations
The construction of s-stage explicit two- and three-step peer methods of order p = 2s and p = 3s is considered for the solution of non-stiff second order initial value problems wh...
Stefan Jebens, Rüdiger Weiner, Helmut Podhais...