On parameters of an evaluation function for heuristic search as a path problem
Page 1
Displaying 1 – 8 of 8
On the average number of registers needed to evaluate a special class of backtrack trees
U. Trier (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls.
Subramani, K. (2009)
Journal of Applied Mathematics and Decision Sciences
On the distributed decision-making complexity of the minimum vertex cover problem
Pierluigi Crescenzi, Luca Trevisan (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On the General Motion-Planning Problem with Two Degrees of Freedom.
L.J. Guibas, Sharir Micha, Shmuel Sifrony (1989)
Discrete & computational geometry
On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space.
Micha Sharir, D. Leven (1987)
Discrete & computational geometry
On the size of minimal unsatisfiable formulas.
Lee, Choongbum (2009)
The Electronic Journal of Combinatorics [electronic only]
Optimal Allocation of Renewable Energy Parks: A Two–stage Optimization Model
Carmen Gervet, Mohammad Atef (2013)
RAIRO - Operations Research - Recherche Opérationnelle
Applied research into Renewable Energies raises complex challenges of a technological, economical or political nature. In this paper, we address the techno−economical optimization problem of selecting locations of wind and solar Parks to be built in Egypt, such that the electricity demand is satisfied at minimal costs. Ultimately, our goal is to build a decision support tool that will provide private and governmental investors into renewable energy systems, valuable insights to make informed short...
Currently displaying 1 – 8 of 8
Page 1