| |
|
|
| |
| | Vladik Kreinovich received his MS in Mathematics and Computer Science from St. Petersburg University, Russia, in 1974, and PhD from the Institute of Mathematics, Soviet Academy of Sciences, Novosibirsk, in 1979. From 1975 to 1980, he worked with the Soviet Academy of Sciences; during this time, he worked with the Special Astrophysical Observatory (focusing on the representation and processing of uncertainty in radioastronomy). For most of the 1980s, he worked on error estimation and intelligent information processing for the National Institute for Electrical Measuring Instruments, Russia. In 1989, he was a visiting scholar at Stanford University. Since 1990, he has worked in the Department of Computer Science at the University of Texas at El Paso. In addition, he has served as an invited professor in Paris (University of Paris VI), France; Hong Kong; St. Petersburg, Russia; and Brazil. His main research interests are the representation and processing of uncertainty, especially interval computations and intelligent control. He has written three books, edited six books, and written more than 800 papers. Vladik is a member of the editorial board of the international journal Reliable Computing (formerly Interval Computations) and several other journals. In addition, he is the co-maintainer of the international Web site on interval computations (http://www.cs.utep.edu/interval-comp). Vladik serves as president of the North American Fuzzy Information Processing Society; is a foreign member of the Russian Academy of Metrological Sciences; was the recipient of the 2003 El Paso Energy Foundation Faculty Achievement Award for Research awarded by the University of Texas at El Paso; and was a co-recipient of the 2005 Star Award from the University of Texas System. |
| |
| |
|
Date Reviewed |
|
| |
1 - 5 of 5
reviews
|
|
|
 |
|
|
|
|
 A brief history of computing, third edition
O¿Regan G., Springer International Publishing, New York, NY, 2021. 384 pp. Type: Book (978-3-030665-98-2)
The first four chapters of A brief history of computing are similar to what is usually described in the
history section of an introductory computer science (CS) textbook: everything from ancient civilizations like Egypt
to Turing and the ...
|
Dec 28 2021 |
|
|
|
|
|
|
Exact algorithms via monotone local search
Fomin F., Gaspers S., Lokshtanov D., Saurabh S. Journal of the ACM 66(2): 1-23, 2019. Type: Article
Many important problems are NP-complete; this means that, unless P = NP, we cannot have a polynomial-time (feasible) algorithm for solving all instances of this problem. For each such problem, there is an exhaustive search algorithm th...
|
Apr 26 2021 |
|
|
|
|
|
|
Algorithms unlocked
Cormen T., The MIT Press, Cambridge, MA, 2013. 240 pp. Type: Book (978-0-262518-80-2), Reviews: (1 of 2)
Computers are ubiquitous. Everyone uses computers and computer-based systems for many daily activities. Many computer applications are very user-friendly, meaning we can use them without understanding how they work, just as we can driv...
|
Sep 24 2013 |
|
|
|
|
|
|
P-splines regression smoothing and difference type of penalty
Gijbels I., Verhasselt A. Statistics and Computing 20(4): 499-511, 2010. Type: Article
The most widely used method of estimating the parameter c of a model y = f(x,c) from data is the least squares method (LSM), when we minimiz...
|
Feb 1 2011 |
|
|
|
|
|
|
Algorithmics for hard problems
Hromkovič J., Springer-Verlag Berlin, Heidelberg, Germany, 2003. 557 pp. Type: Book (9783540441342), Reviews: (1 of 3)
Many computer scientists and computer science students find the theory of computing difficult to understand. Not only are the concepts difficult to grasp and the results difficult to prove, but the emphasis is also sometimes difficult ...
|
Apr 22 2003 |
|
|
|
|
|
| |
|
|
| |
|
|
