온스콜라 학원

실시간 인기검색어

네이버 전문자료검색결과

(72,474건)

AbstractWe continue the investigations concerning the possibility of using spiking neural P systems as a framework for solving computa

Abstract It is widely believed that the probability of satisfiability for random k-SAT formulae exhibits a sharp threshold

C bounded model checking (cbmc) has proved to be a successful approach to automatic software analysis. The key idea is to (i) build a

Abstract 10.1002/rsa.20090.abs Using the cavity equations of Mézard, Parisi, and Zecchina Science 297 (2002), 812; Mézard and Zecchi

AbstractPrograms for the Boolean satisfiability problem (SAT), i.e., SAT solvers, are nowadays used as core decision procedures for a

This study examined the college entrance examination scores of music and nonmusic students in the United States, drawing data from the

AbstractA method for the simultaneous determination of seven commonly used artificial sweeteners in water is presented. The analytes w

In this paper we present the results of an experiment with employing an external SAT solver to strengthen the notion of obviousness of

Abstract We prove the worst-case upper bound 1.5045.. n for the time complexity of 3-SAT decision, where n i

We slightly improve the pruning technique presented in Dantsin et al. (Theoret. Comput. Sci. 289 (2002) 69) to obtain an O*(1.473n) de