2131 search results - page 117 / 427 » Immunity for Closed Sets |
130
click to vote
JSYML
2006
15 years 6 months ago
2006
In [Sca99], T. Scanlon proved a quantifier elimination result for valued D-fields in a three-sorted language by using angular component functions. Here we prove an analogous theore...
162
click to vote
DAM
2002
15 years 6 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
169
click to vote
NECO
2010
15 years 4 months ago
2010
Most conventional Policy Gradient Reinforcement Learning (PGRL) algorithms neglect (or do not explicitly make use of) a term in the average reward gradient with respect to the pol...
166
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
188
click to vote
COMBINATORICA
2010
15 years 3 months ago
2010
A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimens...