Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 205,754,777 papers from all fields of science

Search

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

Highly Cited

2015

Highly Cited

2015

Several machine learning models, including neural networks, consistently misclassify adversarial examples---inputs formed by…

Highly Cited

2005

Highly Cited

2005

Wireless ad hoc sensor networks have recently emerged as a premier research topic. They have great long-term economic potential…

Highly Cited

2001

Highly Cited

2001

The Strength Pareto Evolutionary Algorithm (SPEA) (Zitzler and Thiele 1999) is a relatively recent technique for finding or…

Highly Cited

1999

Highly Cited

1999

SeDuMi is an add-on for MATLAB, which lets you solve optimization problems with linear, quadratic and semidefiniteness…

Highly Cited

1997

Highly Cited

1997

In the first part of the paper we consider the problem of dynamically apportioning resources among a set of options in a worst…

Highly Cited

1995

Highly Cited

1995

In the first part of the paper we consider the problem of dynamically apportioning resources among a set of options in a worst…

Highly Cited

1993

Highly Cited

1993

Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of…

Highly Cited

1986

Highly Cited

1986

In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms…

Highly Cited

1984

Highly Cited

1984

We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n3.5L) arithmetic…

Highly Cited

1978

Highly Cited

1978

LetN be a finite set andz be a real-valued function defined on the set of subsets ofN that satisfies z(S)+z(T)≥z(S⋃T)+z(S⋂T) for…