نتایج جستجو برای: 4 32

تعداد نتایج: 1408793  

Journal: :CoRR 2007
Jing-Chao Chen

The DIMACS 32-bit parity problem is a satisfiability (SAT) problem hard to solve. So far, EqSatz by Li is the only solver which can solve this problem. However, This solver is very slow. It is reported that it spent 11855 seconds to solve a par32-5 instance on a Maxintosh G3 300 MHz. The paper introduces a new solver, XORSAT, which splits the original problem into two parts: structured part and...

2007
Patricia CHUECA Helga MONTÓN José Luís RIPOLLÉS Pedro CASTAÑERA Enrique MOLTÓ Alberto URBANEJA

Agro-Engineering Center, Valencian Institute for Agricultural Research (IVIA), Ctra. de Moncada a Náquera km. 4.5; Moncada 46113, Valencia, Spain † Entomology Associated Unit IVIA/CIB CSIC, Plant Protection and Biotechnology Center, Valencian Institute for Agricultural Research (IVIA), Ctra. de Moncada a Náquera km. 4.5; Moncada 46113, Valencia, Spain †† Martinavarro S.A., Avda. al Grao, 12, Al...

Journal: :Evangelikal: Jurnal Teologi Injili dan Pembinaan Warga Jemaat 2020

Journal: :JOURNAL OF INDIAN AND BUDDHIST STUDIES (INDOGAKU BUKKYOGAKU KENKYU) 1989

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید