Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

The aim of this paper is to begin developing a version of Gualtiero Piccinini’s mechanistic account of computation that does not… Expand

Is this relevant?

Highly Cited

2015

Highly Cited

2015

Error bounds, which refer to inequalities that bound the distance of vectors in a test set to a given set by a residual function… Expand

Is this relevant?

2014

2014

We show that the symmetric function generalization of the chromatic polynomial, or equivalently, the U-polynomial, distinguishes… Expand

Is this relevant?

2010

2010

The study of monophonic convexity is based on the family of induced paths of a graph. The closure of a subset X of vertices, in… Expand

Is this relevant?

2008

2008

Traditionally, the analysis of Ballistic Missile Defense System (BMDS) effectiveness has been limited in fidelity due to the… Expand

Is this relevant?

2006

2006

For minimizing a proper convex function,this paper compares the difference of subdifferential of function f,when the initial… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Abstract
The DC programming and its DC algorithm (DCA) address the problem of minimizing a function f=g−h (with g,h being lower… Expand

Is this relevant?

2002

2002

Abstract. For two vertices u and v of a connected graph G, the set I[u,v] consists of all those vertices lying on a u−v shortest… Expand

Is this relevant?

Highly Cited

1976

Highly Cited

1976

For the problem of minimizing a lower semicontinuous proper convex function f on a Hilbert space, the proximal point algorithm in… Expand

Is this relevant?

Highly Cited

1966

Highly Cited

1966

Each lower semi-continuous proper convex function / on a Banach space E defines a certain multivalued mapping df from E to E… Expand

Is this relevant?