Results 281 to 290 of about 156,468 (326)
Some of the next articles are maybe not open access.
International Journal of Control, Automation and Systems, 2017
Fang-Fang Zhang +4 more
semanticscholar +1 more source
Fang-Fang Zhang +4 more
semanticscholar +1 more source
Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem
Grid and Pervasive Computing, 2017F. Carrabs +3 more
semanticscholar +1 more source
Upper and Lower Bounds for Stochastic Processes: Modern Methods and Classical Problems
, 2014M. Talagrand
semanticscholar +1 more source
Upper and lower bounds for the numerical radius with an application to involution operators
, 2015A. Abu-Omar, F. Kıttaneh
semanticscholar +1 more source
Sharp upper and lower bounds for the moments of Bernstein polynomials
Applied Mathematics and Computation, 2015J. Adell, J. Bustamante, J. M. Quesada
semanticscholar +1 more source
Information-theoretic upper and lower bounds for statistical estimation
IEEE Transactions on Information Theory, 2006Tong Zhang
semanticscholar +1 more source
Upper and lower bounds in relator spaces.
2012Summary: An ordered pair \(X({\mathcal N}) = (X,{\mathcal N})\) consisting of a nonvoid set \(X\) and a nonvoid family \({\mathcal N}\) of binary relations on \(X\) is called a relator space. Relator spaces are straightforward generalizations not only of uniform spaces, but also of ordered sets. Therefore, in a relator space we can naturally define not
openaire +2 more sources
Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
at - Automatisierungstechnik, 2014R. Aragues +5 more
semanticscholar +1 more source