Artigos de revistas sobre o tema "Parallel satisfiability"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 50 melhores artigos de revistas para estudos sobre o assunto "Parallel satisfiability".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Veja os artigos de revistas das mais diversas áreas científicas e compile uma bibliografia correta.
Martins, Ruben, Vasco Manquinho e Inês Lynce. "Parallel search for maximum satisfiability". AI Communications 25, n.º 2 (2012): 75–95. http://dx.doi.org/10.3233/aic-2012-0517.
Texto completo da fonteMartins, Ruben. "Parallel search for maximum satisfiability". Constraints 20, n.º 4 (10 de setembro de 2015): 469–70. http://dx.doi.org/10.1007/s10601-015-9207-9.
Texto completo da fonteHAGLIN, DAVID J. "APPROXIMATING MAXIMUM 2-CNF SATISFIABILITY". Parallel Processing Letters 02, n.º 02n03 (setembro de 1992): 181–87. http://dx.doi.org/10.1142/s0129626492000301.
Texto completo da fonteFeldman, Yulik, Nachum Dershowitz e Ziyad Hanna. "Parallel Multithreaded Satisfiability Solver: Design and Implementation". Electronic Notes in Theoretical Computer Science 128, n.º 3 (abril de 2005): 75–90. http://dx.doi.org/10.1016/j.entcs.2004.10.020.
Texto completo da fonteSADOWSKI, Adrian. "A parallel pipelined naive method for testing satisfiability". PRZEGLĄD ELEKTROTECHNICZNY 1, n.º 11 (5 de novembro de 2015): 156–59. http://dx.doi.org/10.15199/48.2015.11.38.
Texto completo da fonteBlochinger, Wolfgang, Carsten Sinz e Wolfgang Küchlin. "Parallel propositional satisfiability checking with distributed dynamic learning". Parallel Computing 29, n.º 7 (julho de 2003): 969–94. http://dx.doi.org/10.1016/s0167-8191(03)00068-1.
Texto completo da fonteWen-Zhang, Liu, Zhang Jing-Fu e Long Gui-Lu. "A Parallel Quantum Algorithm for the Satisfiability Problem". Communications in Theoretical Physics 49, n.º 3 (março de 2008): 629–30. http://dx.doi.org/10.1088/0253-6102/49/3/22.
Texto completo da fonteCheng, Dan. "The New Democratic Revolution in Music during the Play Experience of the Ideological and Political Education Function". Applied Mechanics and Materials 556-562 (maio de 2014): 6602–5. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.6602.
Texto completo da fonteCzutro, Alexander, Ilia Polian, Matthew Lewis, Piet Engelke, Sudhakar M. Reddy e Bernd Becker. "Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability Analysis". International Journal of Parallel Programming 38, n.º 3-4 (1 de janeiro de 2010): 185–202. http://dx.doi.org/10.1007/s10766-009-0124-7.
Texto completo da fonteHEAD, TOM. "PHOTOCOMPUTING: EXPLORATIONS WITH TRANSPARENCY AND OPACITY". Parallel Processing Letters 17, n.º 04 (dezembro de 2007): 339–47. http://dx.doi.org/10.1142/s0129626407003071.
Texto completo da fonteLiao, Xiaojuan, Hui Zhang, Miyuki Koshimura, Rong Huang, Wenxin Yu e Fagen Li. "Modeling and Solving Scheduling in Overloaded Situations with Weighted Partial MaxSAT". Mathematical Problems in Engineering 2021 (16 de julho de 2021): 1–17. http://dx.doi.org/10.1155/2021/9615463.
Texto completo da fonteRintanen, Jussi, Keijo Heljanko e Ilkka Niemelä. "Planning as satisfiability: parallel plans and algorithms for plan search". Artificial Intelligence 170, n.º 12-13 (setembro de 2006): 1031–80. http://dx.doi.org/10.1016/j.artint.2006.08.002.
Texto completo da fonteLiao, Xiaojuan, Hui Zhang, Miyuki Koshimura, Rong Huang e Fagen Li. "Solving Restricted Preemptive Scheduling on Parallel Machines with SAT and PMS". JUCS - Journal of Universal Computer Science 29, n.º 8 (28 de agosto de 2023): 911–37. http://dx.doi.org/10.3897/jucs.97743.
Texto completo da fonteBagchi, Ansuman, Brigitte Servatius e Weigeng Shi. "2-satisfiability and diagnosing faulty processors in massively parallel computing systems". Discrete Applied Mathematics 60, n.º 1-3 (junho de 1995): 25–37. http://dx.doi.org/10.1016/0166-218x(94)00041-b.
Texto completo da fonteLopez Ramirez, Cristina, e Guillermo De Ita Luna. "Modelling the 3-coloring of Serial-Parallel Graphs via Incremental Satisfiability." IEEE Latin America Transactions 17, n.º 04 (abril de 2019): 607–14. http://dx.doi.org/10.1109/tla.2019.8891885.
Texto completo da fonteSohn, Andrew. "Parallel Satisfiability Test with Synchronous Simulated Annealing on Distributed-Memory Multiprocessor". Journal of Parallel and Distributed Computing 36, n.º 2 (agosto de 1996): 195–204. http://dx.doi.org/10.1006/jpdc.1996.0100.
Texto completo da fonteBofill, Miquel, Joan Espasa e Mateu Villaret. "A Semantic Notion of Interference for Planning Modulo Theories". Proceedings of the International Conference on Automated Planning and Scheduling 26 (30 de março de 2016): 56–64. http://dx.doi.org/10.1609/icaps.v26i1.13734.
Texto completo da fonteMartins, Ruben, Vasco Manquinho e Inês Lynce. "Deterministic Parallel MaxSAT Solving". International Journal on Artificial Intelligence Tools 24, n.º 03 (junho de 2015): 1550005. http://dx.doi.org/10.1142/s0218213015500050.
Texto completo da fonteRankooh, Masood Feyzbakhsh, e Gholamreza Ghassem-Sani. "ITSAT: An Efficient SAT-Based Temporal Planner". Journal of Artificial Intelligence Research 53 (30 de julho de 2015): 541–632. http://dx.doi.org/10.1613/jair.4697.
Texto completo da fonteGuo, Wensheng, Guowu Yang, Wei Wu, Lei He e Mingyu Sun. "A Parallel Attractor Finding Algorithm Based on Boolean Satisfiability for Genetic Regulatory Networks". PLoS ONE 9, n.º 4 (9 de abril de 2014): e94258. http://dx.doi.org/10.1371/journal.pone.0094258.
Texto completo da fonteLiu, Shengcai, Ke Tang e Xin Yao. "Automatic Construction of Parallel Portfolios via Explicit Instance Grouping". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julho de 2019): 1560–67. http://dx.doi.org/10.1609/aaai.v33i01.33011560.
Texto completo da fonteZhang, Kairong, e Masahiro Nagamatu. "Using Attenuation Coefficient Generating Function in Parallel Execution of Neural Networks for Solving SAT". Journal of Advanced Computational Intelligence and Intelligent Informatics 9, n.º 2 (20 de março de 2005): 121–26. http://dx.doi.org/10.20965/jaciii.2005.p0121.
Texto completo da fonteARBELAEZ, ALEJANDRO, CHARLOTTE TRUCHET e PHILIPPE CODOGNET. "Using sequential runtime distributions for the parallel speedup prediction of SAT local search". Theory and Practice of Logic Programming 13, n.º 4-5 (julho de 2013): 625–39. http://dx.doi.org/10.1017/s1471068413000392.
Texto completo da fonteLück, Martin. "Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic". International Journal of Foundations of Computer Science 29, n.º 01 (janeiro de 2018): 17–61. http://dx.doi.org/10.1142/s0129054118500028.
Texto completo da fonteAlhazov, Artiom. "Minimal Parallelism and Number of Membrane Polarizations". Triangle, n.º 6 (28 de junho de 2018): 1. http://dx.doi.org/10.17345/triangle6.1-17.
Texto completo da fonteKatsirelos, George, Ashish Sabharwal, Horst Samulowitz e Laurent Simon. "Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers". Proceedings of the AAAI Conference on Artificial Intelligence 27, n.º 1 (30 de junho de 2013): 481–88. http://dx.doi.org/10.1609/aaai.v27i1.8660.
Texto completo da fonteSong, Bosheng, e Yuan Kong. "Solution to PSPACE-Complete Problem Using P Systems with Active Membranes with Time-Freeness". Mathematical Problems in Engineering 2019 (27 de junho de 2019): 1–8. http://dx.doi.org/10.1155/2019/5793234.
Texto completo da fonteRybakov, V. "Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents". International Journal of Intelligent Information Technologies 6, n.º 1 (janeiro de 2010): 31–45. http://dx.doi.org/10.4018/jiit.2010100903.
Texto completo da fonteDomshlak, C., J. Hoffmann e A. Sabharwal. "Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings". Journal of Artificial Intelligence Research 36 (21 de dezembro de 2009): 415–69. http://dx.doi.org/10.1613/jair.2817.
Texto completo da fonteNgoko, Yanik, Christophe Cérin e Denis Trystram. "Solving Sat in a Distributed Cloud: A Portfolio Approach". International Journal of Applied Mathematics and Computer Science 29, n.º 2 (1 de junho de 2019): 261–74. http://dx.doi.org/10.2478/amcs-2019-0019.
Texto completo da fonteБогачкова, И. А., О. С. Заикин, С. Е. Кочемазов, И. В. Отпущенников, А. А. Семенов e О. О. Хамисов. "Problems of search for collisions of cryptographic hash functions of the MD family as variants of Boolean satisfiability problem". Numerical Methods and Programming (Vychislitel'nye Metody i Programmirovanie), n.º 1 (2 de abril de 2015): 61–77. http://dx.doi.org/10.26089/nummet.v16r107.
Texto completo da fonteIshebabi, Harold, Philipp Mahr, Christophe Bobda, Martin Gebser e Torsten Schaub. "Answer Set versus Integer Linear Programming for Automatic Synthesis of Multiprocessor Systems from Real-Time Parallel Programs". International Journal of Reconfigurable Computing 2009 (2009): 1–11. http://dx.doi.org/10.1155/2009/863630.
Texto completo da fonteDrechsler, Rolf, Görschwin Fey e Sebastian Kinder. "An integrated approach for combining BDDs and SAT provers". Facta universitatis - series: Electronics and Energetics 20, n.º 3 (2007): 415–36. http://dx.doi.org/10.2298/fuee0703415d.
Texto completo da fonteHao e Liu. "Enhanced Membrane Computing Algorithm for SAT Problems Based on the Splitting Rule". Symmetry 11, n.º 11 (15 de novembro de 2019): 1412. http://dx.doi.org/10.3390/sym11111412.
Texto completo da fonteINTERLANDI, MATTEO, e LETIZIA TANCA. "A datalog-based computational model for coordination-free, data-parallel systems". Theory and Practice of Logic Programming 18, n.º 5-6 (setembro de 2018): 874–927. http://dx.doi.org/10.1017/s147106841800042x.
Texto completo da fonteBehnke, Gregor, e Susanne Biundo. "X and more Parallelism. Integrating LTL-Next into SAT-based Planning with Trajectory Constraints while Allowing for even more Parallelism". Inteligencia Artificial 21, n.º 62 (11 de setembro de 2018): 75. http://dx.doi.org/10.4114/intartif.vol21iss62pp75-90.
Texto completo da fonteAlgazy, Kunbolat, Kairat Sakan e Nursulu Kapalova. "Evaluation of the strength and performance of a new hashing algorithm based on a block cipher". International Journal of Electrical and Computer Engineering (IJECE) 13, n.º 3 (1 de junho de 2023): 3124. http://dx.doi.org/10.11591/ijece.v13i3.pp3124-3130.
Texto completo da fonteShi, Kai, Huiqun Yu, Jianmei Guo, Guisheng Fan, Liqiong Chen e Xingguang Yang. "A Parallel Framework of Combining Satisfiability Modulo Theory with Indicator-Based Evolutionary Algorithm for Configuring Large and Real Software Product Lines". International Journal of Software Engineering and Knowledge Engineering 29, n.º 04 (abril de 2019): 489–513. http://dx.doi.org/10.1142/s0218194019500219.
Texto completo da fonteMinaeva, Anna, e Zdeněk Hanzálek. "Survey on Periodic Scheduling for Time-triggered Hard Real-time Systems". ACM Computing Surveys 54, n.º 1 (abril de 2021): 1–32. http://dx.doi.org/10.1145/3431232.
Texto completo da fonteHOOS, HOLGER, ROLAND KAMINSKI, MARIUS LINDAUER e TORSTEN SCHAUB. "aspeed: Solver scheduling via answer set programming". Theory and Practice of Logic Programming 15, n.º 1 (17 de fevereiro de 2014): 117–42. http://dx.doi.org/10.1017/s1471068414000015.
Texto completo da fonteMuniyandi, Ravie Chandren, e Ali Maroosi. "A Representation of Membrane Computing with a Clustering Algorithm on the Graphical Processing Unit". Processes 8, n.º 9 (22 de setembro de 2020): 1199. http://dx.doi.org/10.3390/pr8091199.
Texto completo da fonteTan, Daniel Bochen, Dolev Bluvstein, Mikhail D. Lukin e Jason Cong. "Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors". Quantum 8 (14 de março de 2024): 1281. http://dx.doi.org/10.22331/q-2024-03-14-1281.
Texto completo da fonteGütl, Christian. "Editorial". JUCS - Journal of Universal Computer Science 29, n.º 8 (28 de agosto de 2023): 836–37. http://dx.doi.org/10.3897/jucs.109658.
Texto completo da fontePantůčková, Kristýna, e Roman Barták. "Compilation-Based Approaches to Parallel Planning: An Empirical Comparison". International FLAIRS Conference Proceedings 34, n.º 1 (18 de abril de 2021). http://dx.doi.org/10.32473/flairs.v34i1.128537.
Texto completo da fonteBybee, Connor, Denis Kleyko, Dmitri E. Nikonov, Amir Khosrowshahi, Bruno A. Olshausen e Friedrich T. Sommer. "Efficient optimization with higher-order ising machines". Nature Communications 14, n.º 1 (27 de setembro de 2023). http://dx.doi.org/10.1038/s41467-023-41214-9.
Texto completo da fonteHeule, Marijn. "Schur Number Five". Proceedings of the AAAI Conference on Artificial Intelligence 32, n.º 1 (26 de abril de 2018). http://dx.doi.org/10.1609/aaai.v32i1.12209.
Texto completo da fonteBofill, Miquel, Joan Espasa e Mateu Villaret. "Relaxing non-interference requirements in parallel plans". Logic Journal of the IGPL, 1 de agosto de 2019. http://dx.doi.org/10.1093/jigpal/jzz026.
Texto completo da fonteYin, Zhixiang, Jing Yang, Qiang Zhang, Zhen Tang, Guoqiang Wang e Zhongtuan Zheng. "DNA Computing Model for Satisfiability Problem Based on Hybridization Chain Reaction". International Journal of Pattern Recognition and Artificial Intelligence, 12 de outubro de 2020, 2159010. http://dx.doi.org/10.1142/s0218001421590102.
Texto completo da fonteGrimaldi, Andrea, Luis Sánchez-Tejerina, Navid Anjum Aadit, Stefano Chiappini, Mario Carpentieri, Kerem Camsari e Giovanni Finocchio. "Spintronics-compatible Approach to Solving Maximum-Satisfiability Problems with Probabilistic Computing, Invertible Logic, and Parallel Tempering". Physical Review Applied 17, n.º 2 (18 de fevereiro de 2022). http://dx.doi.org/10.1103/physrevapplied.17.024052.
Texto completo da fonteBannach, Max, Malte Skambath e Till Tantau. "On the Parallel Parameterized Complexity of MaxSAT Variants". Journal of Artificial Intelligence Research 78 (19 de novembro de 2023). http://dx.doi.org/10.1613/jair.1.14748.
Texto completo da fonte