Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Albeanu, Grigore
Spiru Haret University
Bucharest, Romania
 
   Featured Reviewer
   Reader Recommended
   Reviewer Selected
   Highlighted
Follow this Reviewer
 
 
 

Grigore Albeanu is a professor of computer science at Spiru Haret University in Bucharest, Romania. He received his PhD in mathematics, in 1996, from the University of Bucharest.

Grigore has also worked as a software analyst and developer for the Forest Research and Management Institute (1984-1986, https://icas.ro/) and the Institute of Scientific Research and Technological Engineering for Computing and Informatics (1986-1991, https://www.itc.ro/). He was an associate professor at Bucharest University until 2002, and served as the head of the UNESCO Chair in Information Technologies at the University of Oradea (2004-2007).

As principal investigator in a North Atlantic Treaty Organization (NATO) project, Grigore collaborated with colleagues from all over the world on many scientific projects, including PhD theses and national and international competitions, as well as consultancy for small and medium enterprises.

His current research interests are different aspects of computing systems, modeling and simulation, software reliability, virtual reality techniques, fog computing, smart technologies, and scientific computing, including computational intelligence, numerical methods, and machine learning.

Grigore has authored (or coauthored) over 120 papers and ten textbooks in applied mathematics and computer science. He is an active referee or editor for many journals and conferences, and has been a reviewer for Computing Reviews since 1988.

 
 
Options:
Date Reviewed  
 
1
- 6 of 6 reviews

   
   Dempster’s rule of combination
Shafer G. International Journal of Approximate Reasoning 7926-40, 2016.  Type: Article

The rule of combination of belief functions on infinite sets of possibilities is developed in this paper. The author continues his developments on Dempster’s theory on lower probabilities in order to generalize already-obtain...

Feb 22 2017  
   Computing with real numbers, from Archimedes to Turing and beyond
Braverman M. Communications of the ACM 56(9): 74-83, 2013.  Type: Article

Under a concise and a very attractive title, the author invites the reader to a beautiful journey over the computability field....

Jan 28 2014  
   Design of modern heuristics: principles and application
Rothlauf F., Springer Publishing Company, Incorporated, New York, NY, 2011. 278 pp.  Type: Book (978-3-540729-61-7)

To use heuristic approaches in problem solving, one needs a good understanding of the problem to be solved. Particular aspects of the problem should be used when designing a heuristic solver. This book represents the best guideR...

Apr 12 2012  
  The stochastic root-finding problem: overview, solutions, and open questions
Pasupathy R., Kim S. ACM Transactions on Modeling and Computer Simulation 21(3): 1-23, 2011.  Type: Article, Reviews: (1 of 2)

Both application- and theory-oriented scientists are familiar with the root-finding problem. The scientific literature is not only rich in original proposals and tutorials, but also in excellent books--Pasupathy and Kim mentio...

May 27 2011  
   Topology- and error-driven extension of scalar functions from surfaces to volumes
Patanè G., Spagnuolo M., Falcidieno B. ACM Transactions on Graphics (TOG) 29(1): 1-20, 2009.  Type: Article

Surface data has been recently used for volumetric computation in various fields of science, such as geographical data analysis, engineering, molecular modeling and simulation, and scientific visualization. This paper contributes to th...

Mar 25 2010  
  Handbook of approximation algorithms and metaheuristics (Chapman & Hall/CRC Computer & Information Science Series)
Gonzalez T., Chapman & Hall/CRC, 2007. 1432 pp.  Type: Book (9781584885504), Reviews: (2 of 2)

Approximation algorithms are used to find near-optimal solutions to some hard optimization problems. For “inapproximable” problems, metaheuristics methodologies are proposed. A lot of research has already been condu...

Feb 11 2008  
 
 
 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy