Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

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

Review

2019

Review

2019

Coverage path planning consists of finding the route which covers every point of a certain area of interest. In recent times… Expand

Highly Cited

2010

Highly Cited

2010

We propose MC+, a fast, continuous, nearly unbiased and accurate method of penalized variable selection in high-dimensional… Expand

Highly Cited

2009

Highly Cited

2009

The concave-convex procedure (CCCP) is a majorization-minimization algorithm that solves d.c. (difference of convex functions… Expand

Highly Cited

2001

Highly Cited

2001

We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed… Expand

Highly Cited

1999

Highly Cited

1999

When analyzing the productivity of firms, one may want to compare how the firms transform a set of inputs x (typically labor… Expand

Highly Cited

1996

Highly Cited

1996

The problem of assigning m points in the n-dimensional real space Rn to k clusters is formulated as that of determining k centers… Expand

Highly Cited

1985

Highly Cited

1985

This article establishes the relationship between the static axiomatic theory of bargaining and the sequential strategic approach… Expand

Highly Cited

1983

Highly Cited

1983

The convexity of technology has played a crucial role in economic analyses of optimal one-sector growth problems. For example… Expand

Highly Cited

1980

Highly Cited

1980

Although they play a fundamental role in nearly all branches of mathematics, inequalities are usually obtained by ad hoc methods… Expand

Highly Cited

1973

Highly Cited

1973

The purpose of the present paper is to give a new proof for the main theorem proved in [3] and develop further properties of… Expand