8413 search results - page 240 / 1683 » Ordering Problem Subgoals |
JSCIC
2011
14 years 9 months ago
2011
We propose and analyze several two-level additive Schwarz preconditioners for a weakly over-penalized symmetric interior penalty method for second order elliptic boundary value pro...
132
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
This paper explores connections between Ficici’s notion of solution concept and order theory. Ficici postulates that algorithms should ascend an order called weak preference; th...
BIRTHDAY
2009
Springer
15 years 9 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
163
click to vote
RTA
1993
Springer
15 years 7 months ago
1993
Springer
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
130
click to vote
JCST
2010
14 years 9 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...