1041 search results - page 118 / 209 » Randomizing Reductions of Search Problems |
ARC
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. This paper presents a methodology for the design of a reconfigurable computing system applied to a complex problem in molecular Biology: the protein folding problem. An e...
CP
2006
Springer
13 years 11 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
PUK
2000
13 years 9 months ago
2000
GraphPlan-like and SATPLAN-like planners have shown to outperform classical planners for most of the classical planning domains. However, these two propositional approaches do not ...
JGO
2010
13 years 6 months ago
2010
In this paper, the global optimization problem with an objective function that is multiextremal that satisfies the Lipschitz condition over a hypercube is considered. An algorithm...
GLVLSI
2007
IEEE
14 years 2 months ago
2007
IEEE
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...