Диссертация (Исследование и разработка методов автоматического вывода геометрических ограничений с использованием декларативного программирования и формальных методов), страница 21
Описание файла
Файл "Диссертация" внутри архива находится в папке "Исследование и разработка методов автоматического вывода геометрических ограничений с использованием декларативного программирования и формальных методов". PDF-файл из архива "Исследование и разработка методов автоматического вывода геометрических ограничений с использованием декларативного программирования и формальных методов", который расположен в категории "". Всё это находится в предмете "технические науки" из Аспирантура и докторантура, которые можно найти в файловом архиве РТУ МИРЭА. Не смотря на прямую связь этого архива с РТУ МИРЭА, его также можно найти и в других разделах. , а ещё этот архив представляет собой кандидатскую диссертацию, поэтому ещё представлен в разделе всех диссертаций на соискание учёной степени кандидата технических наук.
Просмотр PDF-файла онлайн
Текст 21 страницы из PDF
Brooks Stephen P, Morgan Byron JT. Optimization using simulated annealing //The Statistician. — 1995. — Pp. 241–257.4. Akbari Reza, Ziarati Koorush. A multilevel evolutionary algorithm for optimizingnumerical functions // International Journal of Industrial Engineering Computations. — 2011. — Vol. 2, no. 2. — Pp. 419–430.5. Bonyadi Mohammad Reza, Michalewicz Zbigniew.
Particle swarm optimizationfor single objective continuous space problems: a review // Evolutionary computation. — 2016.6. Bengio Yoshua, Courville Aaron, Vincent Pascal. Representation learning: A review and new perspectives // IEEE transactions on pattern analysis and machineintelligence. — 2013. — Vol. 35, no. 8.
— Pp. 1798–1828.7. A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems / Angel A Juan, Javier Faulin, Scott E Grasmanet al. // Operations Research Perspectives. — 2015. — Vol. 2. — Pp. 62–72.8. Neto Paulo. Demystifying cloud computing // Proceeding of Doctoral Symposiumon Informatics Engineering. — 2011.9. Columbus Louis.
Roundup Of Cloud Computing Forecasts And Market Estimates,2014 // Forbes Magazine. — 2015.10. Mainzer Klaus. The cause of complexity in nature: An analytical and computational approach // How Nature Works. — Springer, 2014. — Pp. 19–49.10811. Complexity Reduction: Local Activity Ranking By Resource Entropy For QoSaware Cloud Scheduling / Huankai Chen, Frank Wang, Matteo Migliavacca et al. //Services Computing (SCC), 2016 IEEE International Conference on / IEEE. —2016. — Pp. 585–592.12. Zaharia Matei.
Spark: In-Memory Cluster Computing for Iterative and InteractiveApplications // Invited Talk. NIPS Big Learning Workshop: Algorithms, Systems,and Tools for Learning at Scale (Granada, Spain. December 12–17, 2011). —2011.13. Hellerstein Joe. Parallel programming in the age of big data // Gigaom Blog. —2008.14. Segaran Toby, Hammerbacher Jeff. Beautiful data: the stories behind elegant datasolutions.
— ”O’Reilly Media, Inc. 2009.15. Data IBM Big. IBM-Bringing Big Data to the Enterprise. — 2015.16. Fong S., Wong R., Vasilakos A. V. Accelerated PSO Swarm Search Feature Selection for Data Stream Mining Big Data // IEEE Transactions on Services Computing. — 2016. — Jan. — Vol.
9, no. 1. — Pp. 33–45.17. Internet of Things (IoT): A vision, architectural elements, and futuredirections / Jayavardhana Gubbi, Rajkumar Buyya, Slaven Marusic,Marimuthu Palaniswami // Future Generation Computer Systems. — 2013. —Vol. 29, no. 7. — Pp. 1645–1660.18. On the integration of cloud computing and internet of things / Alessio Botta, Walter De Donato, Valerio Persico, Antonio Pescapé // Future Internet of Things andCloud (FiCloud), 2014 International Conference on / IEEE. — 2014. — Pp. 23–30.19. of Things Global Standards Initiative Internet et al.
ITU. — 2015.20. Choi Yeongho, Lim Yujin. Optimization Approach for Resource Allocation onCloud Computing for IoT // International Journal of Distributed Sensor Networks.— 2016. — Vol. 2016.10921. Cramton Peter, Shoham Yoav, Steinberg Richard. Combinatorial auctions. —2006.22. Kamal Rossi, Hong Choong Seon, Choi Mi-Jung.
Autonomic Resilient Internetof-Things(IoT)Management // CoRR. — 2015. — Vol. abs/1508.03975. — URL:http://arxiv.org/abs/1508.03975.23. Frame Conditions in Symbolic Representations of UML/OCL Models /Nils Przigoda, Jonas Gomes Filho, Philipp Niemann et al. // Int’l Conf. FormalMethods and Models for System Design. — 2016.24.
Stanley Jason, Liao Hongwei, Lafortune Stéphane. SAT-Based Control of Concurrent Software for Deadlock Avoidance // IEEE Transactions on Automatic Control. — 2015. — Vol. 60, no. 12. — Pp. 3269–3274.25. Lin Hai. A Scalable Method for a Particular Scheduling Problem Based onBoolean Satisfiability. — 2015.26. Chaff: Engineering an efficient SAT solver / Matthew W Moskewicz,Conor F Madigan, Ying Zhao et al. // Proceedings of the 38th annual Design Automation Conference / ACM. — 2001. — Pp. 530–535.27. Whittemore Jesse, Kim Joonyoung, Sakallah Karem.
SATIRE: A new incrementalsatisfiability engine // Design Automation Conference, 2001. Proceedings / IEEE.— 2001. — Pp. 542–545.28. Biere Armin. PicoSAT essentials // Journal on Satisfiability, Boolean Modelingand Computation. — 2008. — Vol. 4. — Pp. 75–97.29. Eén Niklas, Biere Armin. Effective preprocessing in SAT through variable andclause elimination // International conference on theory and applications of satisfiability testing / Springer. — 2005. — Pp. 61–75.30. Nadel Alexander, Ryvchin Vadim, Strichman Ofer. Preprocessing in incrementalSAT // International Conference on Theory and Applications of Satisfiability Testing / Springer. — 2012. — Pp. 256–269.31. Nadel Alexander, Ryvchin Vadim.
Efficient SAT solving under assumptions //International Conference on Theory and Applications of Satisfiability Testing /Springer. — 2012. — Pp. 242–255.11032. Nadel Alexander, Ryvchin Vadim, Strichman Ofer. Ultimately incremental SAT //International Conference on Theory and Applications of Satisfiability Testing /Springer. — 2014. — Pp. 206–218.33. KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. / Cristian Cadar, Daniel Dunbar, Dawson R Engler et al. //OSDI. — Vol. 8. — 2008.
— Pp. 209–224.34. Dase: Document-assisted symbolic execution for improving automated softwaretesting / Edmund Wong, Lei Zhang, Song Wang et al. // 2015 IEEE/ACM 37thIEEE International Conference on Software Engineering / IEEE. — Vol. 1. —2015. — Pp. 620–631.35. Boolean Satisfiability Approach to Optimal Multi-agent Path Finding Under theSum of Costs Objective: (Extended Abstract) / Pavel Surynek, Ariel Felner,Roni Stern, Eli Boyarski // Proceedings of the 2016 International Conference onAutonomous Agents & Multiagent Systems.
— AAMAS ’16. — Richland,SC: International Foundation for Autonomous Agents and Multiagent Systems,2016. — Pp. 1435–1436. — URL: http://dl.acm.org/citation.cfm?id=2937029.2937197.36. Berg Jeremias, Hyttinen Antti, Järvisalo Matti. Applications of MaxSAT in DataAnalysis // Easychair Proceedings in Computing. EasyChair. — 2015.37. MaxSAT-Based Scheduling of B2B Meetings / Miquel Bofill, Marc Garcia,Josep Suy, Mateu Villaret // Integration of AI and OR Techniques in ConstraintProgramming: 12th International Conference, CPAIOR 2015, Barcelona, Spain,May 18-22, 2015, Proceedings / Ed.
by Laurent Michel. — Cham: Springer International Publishing, 2015. — Pp. 65–73. — URL: http://dx.doi.org/10.1007/978-3-319-18008-3_5.38. Sule Virendra. Implicant based parallel all solution solver for Boolean satisfiability // arXiv preprint arXiv:1611.09590. — 2016.39. Gaudioso Ginevra, Leonetti Matteo, Stone Peter. State Aggregation through Reasoning in Answer Set Programming. — Leeds, 2016.11140. Gebser Martin, Ryabokon Anna, Schenner Gottfried. Combining Heuristics forConfiguration Problems Using Answer Set Programming // Logic Programming and Nonmonotonic Reasoning: 13th International Conference, LPNMR2015, Lexington, KY, USA, September 27-30, 2015.
Proceedings / Ed. byFrancesco Calimeri, Giovambattista Ianni, Miroslaw Truszczynski. — Cham:Springer International Publishing, 2015. — Pp. 384–397. — URL: http://dx.doi.org/10.1007/978-3-319-23264-5_32.41. Automated Resource Allocation in Business Processes with Answer Set Programming / Giray Havur, Cristina Cabanillas, Jan Mendling, Axel Polleres // 11th International Workshop on Business Process Intelligence. — 2015.42.
Mansor Mohd Asyraf, Kasihmuddin Mohd Shareduwan M, Sathasivam Saratha.VLSI Circuit Configuration Using Satisfiability Logic in Hopfield Network // International Journal of Intelligent Systems and Applications (IJISA). — 2016. —Vol. 8, no. 9. — P. 22.43. Hopfield John J. Neural networks and physical systems with emergent collectivecomputational abilities // Proceedings of the national academy of sciences.
—1982. — Vol. 79, no. 8. — Pp. 2554–2558.44. Chandrakar Khushbu, Mishra Shashank, Roy Suchismita. SAT based low powerscheduling and module binding with clock gating // Computer, Communication,Control and Information Technology (C3IT), 2015 Third International Conferenceon / IEEE.
— 2015. — Pp. 1–5.45. Kaxiras S., Martonosi M. 4.2 Idle unit switching activity: clock gating // Architectural Techniques for Low Power. — 2008. — Vol. 4, no. 8. — P. 207.46. Ganguly Pritha, Chandrakar Khushbu, Roy Suchismita. SAT based approach forpower on inrush current minimization with power gating // Electronics, Computing and Communication Technologies (CONECCT), 2015 IEEE InternationalConference on / IEEE. — 2015. — Pp. 1–5.47. Chandrakar Khushbu, Roy Suchismita. Effect of increasing voltage levels onpower saving obtained by multiple voltages design // Advance Computing Conference (IACC), 2015 IEEE International / IEEE. — 2015. — Pp.
867–871.11248. SAT-ATPG for application-oriented FPGA testing / Robert Hülle, Petr Fišer,Jan Schmidt, Jaroslav Boreckỳ // Electronics Conference (BEC), 2016 15th Biennial Baltic / IEEE. — 2016. — Pp. 83–86.49. Safar Mona, Salem Ashraf. Solving constraints in FPGA detailed routing usingSMT // 2015 IEEE International Conference on Electronics, Circuits, and Systems(ICECS) / IEEE. — 2015. — Pp. 613–616.50. Iizuka Tetsuya, Ikeda Makoto, Asada Kunihiro. High speed layout synthesis forminimum-width CMOS logic cells via Boolean satisfiability // IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences.
