標(biāo)題: Titlebook: Agents and Artificial Intelligence; 5th International Co Joaquim Filipe,Ana Fred Conference proceedings 2014 Springer-Verlag Berlin Heidelb [打印本頁(yè)] 作者: cucumber 時(shí)間: 2025-3-21 17:54
書(shū)目名稱Agents and Artificial Intelligence影響因子(影響力)
書(shū)目名稱Agents and Artificial Intelligence影響因子(影響力)學(xué)科排名
書(shū)目名稱Agents and Artificial Intelligence網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Agents and Artificial Intelligence網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Agents and Artificial Intelligence被引頻次
書(shū)目名稱Agents and Artificial Intelligence被引頻次學(xué)科排名
書(shū)目名稱Agents and Artificial Intelligence年度引用
書(shū)目名稱Agents and Artificial Intelligence年度引用學(xué)科排名
書(shū)目名稱Agents and Artificial Intelligence讀者反饋
書(shū)目名稱Agents and Artificial Intelligence讀者反饋學(xué)科排名
作者: 樹(shù)木心 時(shí)間: 2025-3-21 21:24
Francesco Tajani,Pierluigi Moranot system. In this way exchange of parts and subsystems is possible. The possibilities and advantages of this concept are discussed as well as a more elaborate example of the implementation in an experimental discovery robot.作者: Banquet 時(shí)間: 2025-3-22 01:55 作者: 闡釋 時(shí)間: 2025-3-22 07:00 作者: 極大的痛苦 時(shí)間: 2025-3-22 09:17
Ergebnisse der empirischen Studiend discussed. Sentence reduction is performed by removing specific sentential constructions conveying information that can be considered to be less relevant to the general message of the summary. Thus, the rationale is that sentence reduction not only removes expendable information, but also makes room for further relevant data in a summary.作者: 群居動(dòng)物 時(shí)間: 2025-3-22 16:41 作者: POLYP 時(shí)間: 2025-3-22 18:31
Gatekeepers: Information Dissemination,ons with respect to .. A general-level Java/Prolog framework for norm-regulated transition system situations has been developed, and this implementation together with a simple example system is presented and discussed.作者: 代替 時(shí)間: 2025-3-23 00:28 作者: 窒息 時(shí)間: 2025-3-23 02:01
Francesco Tajani,Pierluigi Moranoocess, result of the small deformations in the active model elements and through time. The new proposal was tested in different artificial and real images, showing the capabilities of the methodology.作者: debacle 時(shí)間: 2025-3-23 07:32 作者: gain631 時(shí)間: 2025-3-23 11:22 作者: 突變 時(shí)間: 2025-3-23 15:15 作者: 銀版照相 時(shí)間: 2025-3-23 19:07
Path Planning for Tentacle Robots Using Soft Constraintssfy soft constraints associated with the problem. Experiments with real and simulated tentacle robots demonstrate that our approach is an effective enhancement to the basic probabilistic planner to find practical paths.作者: CYN 時(shí)間: 2025-3-23 23:58 作者: Kaleidoscope 時(shí)間: 2025-3-24 05:13 作者: Ingrained 時(shí)間: 2025-3-24 09:17
1865-0929 ce on Agents and Artificial Intelligence, ICAART 2013, held in Barcelona, Spain, in February 2013. The 20 revised full papers presented together with one invited paper were carefully reviewed and selected from 269 submissions. The papers are organized in two topical sections on artificial intelligen作者: Glucocorticoids 時(shí)間: 2025-3-24 13:41 作者: AMOR 時(shí)間: 2025-3-24 15:24 作者: 確定 時(shí)間: 2025-3-24 20:38
Epistemic and Probabilistic ATL with Quantification and Explicit Strategies equilibria and to treat the behavior of the “counter-coalition” in a very flexible way. We provide bisimulation relations, model checking results, and study the issues arising from the interplay between quantifiers and both epistemic and temporal operators.作者: Mortal 時(shí)間: 2025-3-24 23:40 作者: Femine 時(shí)間: 2025-3-25 04:02
Advances in Science, Technology & Innovatione heuristic uses self-organizing mechanisms to optimize a common global objective in a fully decentralized manner. We show that COHDA is a very efficient decentralized heuristic that is able to tackle a distributed combinatorial problem, without being dependent on centrally gathered knowledge.作者: commute 時(shí)間: 2025-3-25 10:12 作者: 我悲傷 時(shí)間: 2025-3-25 14:13 作者: 諄諄教誨 時(shí)間: 2025-3-25 17:45 作者: BIDE 時(shí)間: 2025-3-25 23:13
Rough Terrain Motion Planning for Actuated, Tracked Robotste including the actuator configurations. We present a roadmap and a RRT* method to perform the path refinement..Our algorithm does not rely on any detailed structure/terrain categorization or on any predefined motion sequences. Hence, our planner can be applied to urban structures, like stairs, as well as rough unstructured environments.作者: 星星 時(shí)間: 2025-3-26 00:47
Generation of Learning Situations According to the Learner’s Profile Within a Virtual Environmentng on the Zone of Proximal Development, we designed a learner’s profile based on a multidimensional space of classes of situations. Each point of the space depicts a belief on the learner’s ability to handle a kind of situation.作者: Stress 時(shí)間: 2025-3-26 04:43
Enhancing Products by Embedding Agents: Adding an Agent to a Robot for Monitoring, Maintenance and Dt system. In this way exchange of parts and subsystems is possible. The possibilities and advantages of this concept are discussed as well as a more elaborate example of the implementation in an experimental discovery robot.作者: right-atrium 時(shí)間: 2025-3-26 10:48 作者: nuclear-tests 時(shí)間: 2025-3-26 16:08 作者: 笨重 時(shí)間: 2025-3-26 20:41 作者: 好色 時(shí)間: 2025-3-26 21:51 作者: 清楚 時(shí)間: 2025-3-27 03:33
Agents and Artificial Intelligence978-3-662-44440-5Series ISSN 1865-0929 Series E-ISSN 1865-0937 作者: 巡回 時(shí)間: 2025-3-27 07:16 作者: 頂點(diǎn) 時(shí)間: 2025-3-27 11:00 作者: 邊緣 時(shí)間: 2025-3-27 15:20 作者: chastise 時(shí)間: 2025-3-27 19:50
Mikhail Peppas,Sanabelle Ebrahimurned out that the minimax approach, so successful in chess, did not work in Go. Instead, after some ten years of intensive research, a new method was developed: MCTS (Monte Carlo Tree Search), with promising results. MCTS works by averaging the results of random play-outs. At first glance it is qui作者: FEAS 時(shí)間: 2025-3-27 23:10
Advances in Science, Technology & Innovationhms have been discussed in the relevant literature. However, these are unfeasible if high-arity constraints are present (i.e., a?fully connected constraint graph). This is the case in distributed combinatorial problems, for example in the provisioning of active power in the domain of electrical ener作者: 謙虛的人 時(shí)間: 2025-3-28 03:13 作者: BOON 時(shí)間: 2025-3-28 06:31 作者: 性上癮 時(shí)間: 2025-3-28 13:32
Gatekeepers: Information Dissemination,itions between different system states, is presented. The approach is based on relating the permission or prohibition of actions to the permission or prohibition of different types of state transitions with respect to some condition . on a number of agents . in a state. It introduces the notion of a作者: Gossamer 時(shí)間: 2025-3-28 16:36
Local Self-sustainable Developmentanced flexibility and reachability. Planning practical paths for these devices is challenging due to their high number of degrees of freedom (DOFs). Sampling-based path planners are a common approach to the high DOF planning problem associated with tentacle robots but the solutions found using such 作者: 微塵 時(shí)間: 2025-3-28 20:14 作者: Limerick 時(shí)間: 2025-3-29 00:47 作者: 翻動(dòng) 時(shí)間: 2025-3-29 04:23
Francesco Tajani,Pierluigi Moranoork (ANN), which defines the deformations of the segmentation model through time. As deformable model we used Topological Active Nets, model which integrates features of region-based and boundary-based segmentation techniques. The evolved Artificial Neural Network learns to move each node of the seg作者: 敵手 時(shí)間: 2025-3-29 10:38 作者: Affectation 時(shí)間: 2025-3-29 15:06 作者: 牽索 時(shí)間: 2025-3-29 15:48
Cultural Theory After the Contemporarytween residential electricity consumption and inhabitants behaviour. We first present the proposed meta-model and the associated simulator. We illustrate their use by specialist on concrete examples featuring classical household activities. We also put an emphasis on the systems adaptation mechanism作者: 馬籠頭 時(shí)間: 2025-3-29 20:04
Cultural Theory and the Problem of Modernitys approach, we proposed earlier to map each incoming document to its corresponding task context - denominated as Attentive Task (AT) - by applying search with Dempster-Shafer theory. In this paper, we extend the search algorithm with methods from machine learning for addressing the challenges in rea作者: Mawkish 時(shí)間: 2025-3-30 03:46 作者: 種子 時(shí)間: 2025-3-30 05:53 作者: Triglyceride 時(shí)間: 2025-3-30 08:34 作者: Foreknowledge 時(shí)間: 2025-3-30 13:51
Joaquim Filipe,Ana FredIncludes supplementary material: 作者: infinite 時(shí)間: 2025-3-30 19:21 作者: 凝視 時(shí)間: 2025-3-30 23:11
Investigations with Monte Carlo Tree Search for Finding Better Multivariate Horner Schemesurned out that the minimax approach, so successful in chess, did not work in Go. Instead, after some ten years of intensive research, a new method was developed: MCTS (Monte Carlo Tree Search), with promising results. MCTS works by averaging the results of random play-outs. At first glance it is qui作者: LEER 時(shí)間: 2025-3-31 04:56 作者: 尖 時(shí)間: 2025-3-31 08:13 作者: parallelism 時(shí)間: 2025-3-31 13:07
