Results 221 to 230 of about 1,055,399 (260)
Some of the next articles are maybe not open access.

On a Class of Direct Optimization Problems

Journal of Optimization Theory and Applications, 2001
A coordinate transformation is presented, which allows a direct global estimation of a class of integrals without the use of comparison methods such as variational or field techniques. This direct method is applicable to a class of unconstrained optimal control problems. Motivation and applications are presented, too.
openaire   +1 more source

A direct attempt to goldbach problem

Acta Mathematica Sinica, 1989
Let \(r(N)\) denote the representations of an even number \(N\) as the sum of two primes, so that Goldbach's conjecture is that \(r(N)\) is positive for \(N>2\). In the use of the Hardy-Littlewood method to tackle the problem, the contribution to \(r(N)\) from the major arcs gives what may be expected to be the dominating term, to which an associated ...
openaire   +2 more sources

On the problem of retinal directional sensitivity

Proceedings of the Royal Society of London. Series B. Biological Sciences, 1981
Abstract When two physically similar pencils of light enter the eye, one through the pupillary centre and the other near the edge, the former appears brighter and, when monochromatic light is used, generally as though it were of a shorter wavelength.
openaire   +2 more sources

The directed Chinese Postman Problem

Software: Practice and Experience, 2003
AbstractThe Chinese Postman Problem has many applications, including robot exploration, and analysing interactive system and Web site usability. This paper reviews the wide range of applications of the problem and presents complete, executable code to solve it for the case of directed multigraphs.
openaire   +1 more source

The Directed Minimum Latency Problem

2008
The minimum latency problem [17, 6, 14, 2] is a variant of the basic traveling salesman problem, where there is a metric with a specified root vertex r, and the goal is to find a spanning path starting from r that minimizes the sum of arrival times at all vertices (it is also known as the deliveryman problem or traveling repairman problem).
Viswanath Nagarajan, R. Ravi 0001
openaire   +2 more sources

Web services: problems and future directions

Journal of Web Semantics, 2004
Recently, Web services have generated great interests in both vendors and researchers. Web services, based on existing Internet protocols and open standards, can provide a flexible solution to the problem of application integration. With the help of WSDL, SOAP, and UDDI, Web services are becoming popular in Web applications.
Hongbing Wang   +3 more
openaire   +1 more source

Two Problems of Direct Inference

Erkenntnis, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the directions problem in AG(n, q)

Ricerche di Matematica, 2010
Denote by \(AG(n,q)\) and by \(PG(n,q)\), respectively, the affine and the projective geometry of the dimension \(n\) over \(GF(q)\). Look at \(PG(n,q)\) as the union of \( AG(n,q)\) and \( H_{\infty}\), a hyperplane at infinity; a subspace of \(PG(n,q)\) is called affine if it is not contained in \( H_\infty\).
openaire   +3 more sources

Directed metrics and directed graph partitioning problems

Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06, 2006
Moses Charikar   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy