標(biāo)題: Titlebook: Topics in Artificial Intelligence; 5th Catalonian Confe M. Teresa Escrig,Francisco Toledo,Elisabet Golobar Conference proceedings 2002 Spri [打印本頁] 作者: 烹飪 時(shí)間: 2025-3-21 19:52
書目名稱Topics in Artificial Intelligence影響因子(影響力)
書目名稱Topics in Artificial Intelligence影響因子(影響力)學(xué)科排名
書目名稱Topics in Artificial Intelligence網(wǎng)絡(luò)公開度
書目名稱Topics in Artificial Intelligence網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Topics in Artificial Intelligence被引頻次
書目名稱Topics in Artificial Intelligence被引頻次學(xué)科排名
書目名稱Topics in Artificial Intelligence年度引用
書目名稱Topics in Artificial Intelligence年度引用學(xué)科排名
書目名稱Topics in Artificial Intelligence讀者反饋
書目名稱Topics in Artificial Intelligence讀者反饋學(xué)科排名
作者: genesis 時(shí)間: 2025-3-21 21:04
Iliana Gutiérrez Martínez,Rafael E. Bello Pérez. In horticulture, the concept of plant hardiness zones is well established. These zones are based on the lowest mean air temperatures of the coldest month and, as their first usage was in the USA (Rehder 1940), are based on the Fahrenheit scale of temperature. The U.S. Department of Agriculture (US作者: Integrate 時(shí)間: 2025-3-22 03:58
Lledó Museros,M. Teresa Escrig Monferreremi pine are critically endangered. Vestiges of the ancient conifer diaspora can be seen in the fossilized .-dominated forests in Canadian High Arctic and from the endemic Da Lat ecosystem in Vietnam which includes the flat-leaved .. Conifers are among the oldest extant seed plant lineage and their 作者: committed 時(shí)間: 2025-3-22 06:27
Julio Pacheco,M. Teresa Escrig Monferrer,Francisco Toledo Loboh century number theory, class field theory and algebraic geome- try only strengthen the nineteenth century number theorists‘s view. We just mention the work of E. H~cke, E. Artin, A. Weil and A. Grothendieck with his collaborators. Heeke generalized Dirichlet‘s L-functions to obtain results on the 作者: constellation 時(shí)間: 2025-3-22 12:25 作者: cipher 時(shí)間: 2025-3-22 16:56
T. Alsinet,R. Béjar,A. Cabiscol,C. Fernàndez,F. Manyàt of . in all cases. In this modified routine-we obtain critical points of . successively on mutually conjugate lines and 2-planes, whereas, in the standard .-algorithm, we restrict ourselves to successively locating critical points of . on mutually conjugate lines. A generalized .-algorithm is give作者: JOT 時(shí)間: 2025-3-22 20:06
Daniel Riera,Miquel A. Piera,Antoni Guasch demonstrate its performance with respect to prescribed criteria. An algorithm is certainly feasible if it can be implemented on a computer, possesses computational efficiency (as measured by compu- tational complexity analysis), and exhibits numerical stability. An estimator shows high performance 作者: 倔強(qiáng)一點(diǎn) 時(shí)間: 2025-3-22 21:48
Laura Alonso,Irene Castellón,Karina Gibert,Lluís Padróhus preconditioned system matrix depends on the subdomain diameter (～ 1/..), the width of the over lap (～1/δ) and the diffusion coefficient jump (～max./min.). If the additive Schwarz preconditioner is equipped with a coarse subspace, the condition number estimate is reduced to .[.] and in the case o作者: ABHOR 時(shí)間: 2025-3-23 02:03 作者: 得體 時(shí)間: 2025-3-23 07:16 作者: 使高興 時(shí)間: 2025-3-23 10:59
Knowledge Representation Model for Dynamic Processesive knowledge about the dynamic system which the Knowledge-Based Supervisor is based on, is triggered according to some pre established considerations, among which real time constraints play a special role.作者: 無法取消 時(shí)間: 2025-3-23 15:52
Modeling Motion Qualitatively: Integrating Space and Timelgorithm is guided by composition tables and a converse table provided in this contribution. The algorithm will help, for instance, during the path-planning task of an autonomous robot by describing the sequence of topological situations that the agent should find during its way to the target objective.作者: 多骨 時(shí)間: 2025-3-23 21:38
J. A. Ortega,F. J. Cuberos,R. M. Gasca,M. Toro,J. TorresA Survey作者: 脫落 時(shí)間: 2025-3-24 01:21
Raúl Vilcahuamán,Joaquim Meléndez,Josep Lluis de la Rosa作者: Conduit 時(shí)間: 2025-3-24 03:34
Disjunction of Non-binary and Numeric Constraint Satisfaction Problemsthe disjunctive problem into a non-disjunctive one by means of a statistical preprocess step. Furthermore, a Constraint Ordering Algorithm (COA) classifies the resultant constraints from the most restricted to the least restricted one. This preprocess step can be applied to other disjunctive CSP solvers in order to find a solution earlier.作者: cloture 時(shí)間: 2025-3-24 07:56 作者: kyphoplasty 時(shí)間: 2025-3-24 11:20
Chema Abásolo,Enric Plaza,Josep-Lluís Arcosowever, their significance is a relatively new phenomenon. This comes as a result of the huge influx of Eastern European immigrants over the last fifteen years, which meant that their importance within the social and religious contexts has grown considerably, to the point that Orthodox Christianity 作者: HPA533 時(shí)間: 2025-3-24 15:53 作者: 排他 時(shí)間: 2025-3-24 19:05 作者: 先驅(qū) 時(shí)間: 2025-3-24 23:49 作者: SPASM 時(shí)間: 2025-3-25 04:47 作者: 巡回 時(shí)間: 2025-3-25 08:14
T. Alsinet,R. Béjar,A. Cabiscol,C. Fernàndez,F. Manyà present chapter we shall study the .-algorithm in depth, giving several alternative versions of the .-routine. It is shown that the number of steps required to obtain the minimum point of a quadratic function . is bounded by the number of distinct eigenvalues of the Hessian . of .. Good estimates o作者: CRATE 時(shí)間: 2025-3-25 13:42 作者: TATE 時(shí)間: 2025-3-25 18:27 作者: hypotension 時(shí)間: 2025-3-25 22:43 作者: Favorable 時(shí)間: 2025-3-26 04:01 作者: athlete’s-foot 時(shí)間: 2025-3-26 04:54 作者: Astigmatism 時(shí)間: 2025-3-26 11:32 作者: MEET 時(shí)間: 2025-3-26 15:51 作者: esculent 時(shí)間: 2025-3-26 19:42 作者: 廢墟 時(shí)間: 2025-3-27 00:03
https://doi.org/10.1007/3-540-36079-4AI Logics; Agent Systems; Algorithimc Learning; Artificial Intelligence; Constraint Programming; Formal R作者: 巨碩 時(shí)間: 2025-3-27 02:26
Minimal and Redundant SAT Encodings for the All-Interval-Series ProblemThe SAT encodings defined so far for the all-interval-series (ais) problem are very hard for local search but rather easy for systematic algorithms. We define different SAT encodings for the ais problem and provide experimental evidence that this problem can be efficiently solved with local search methods if one chooses a suitable SAT encoding.作者: 短程旅游 時(shí)間: 2025-3-27 06:56 作者: 根除 時(shí)間: 2025-3-27 11:31 作者: Heretical 時(shí)間: 2025-3-27 17:35
Topics in Artificial Intelligence978-3-540-36079-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 一夫一妻制 時(shí)間: 2025-3-27 19:52
