標(biāo)題: Titlebook: Advances in Artificial Intelligence; 15th Conference of t Robin Cohen,Bruce Spencer Conference proceedings 2002 Springer-Verlag Berlin Heid [打印本頁] 作者: Halloween 時間: 2025-3-21 19:43
書目名稱Advances in Artificial Intelligence影響因子(影響力)
書目名稱Advances in Artificial Intelligence影響因子(影響力)學(xué)科排名
書目名稱Advances in Artificial Intelligence網(wǎng)絡(luò)公開度
書目名稱Advances in Artificial Intelligence網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Artificial Intelligence被引頻次
書目名稱Advances in Artificial Intelligence被引頻次學(xué)科排名
書目名稱Advances in Artificial Intelligence年度引用
書目名稱Advances in Artificial Intelligence年度引用學(xué)科排名
書目名稱Advances in Artificial Intelligence讀者反饋
書目名稱Advances in Artificial Intelligence讀者反饋學(xué)科排名
作者: 高調(diào) 時間: 2025-3-21 21:18
https://doi.org/10.1007/978-1-4615-8155-0portant because it addresses the problem of how a collection of exception handling agents can work in collaboration to monitor problem-solving agents in agent systems and provides insight into how agent systems can be reliable and continue to operate during exceptional circumstances.作者: 有惡意 時間: 2025-3-22 01:06
https://doi.org/10.1007/978-3-642-52115-7le task learning (MTL). The results of experiments on three domains show that TRM is effective in retaining task knowledge in a representational form and transferring that knowledge in the form of virtual examples. TRM with ?MTL is shown to develop more accurate hypotheses for tasks that suffer from impoverished training sets.作者: Arable 時間: 2025-3-22 05:41
Lecture Notes in BiomathematicsWe show that a 2-literal program can be translated to a SAT instance in polynomial time without using extra variables. We report and compare experimental results on solving a number of benchmarks by a stable model generator and by a SAT solver.作者: Eructation 時間: 2025-3-22 12:38
The Construction of the Process,ry (RST). The RST-guided planning paradigm generates coherent communicative plans that apply cinematography knowledge in a principled way. An example shows how the system-generated cinematography structure can enhance the communicative intent of an animation.作者: Semblance 時間: 2025-3-22 12:55
Embeddings in Branching Processes,res no re-scan of the original database for all update cases. The second algorithm is the PotFp-tree (Potential frequent pattern) algorithm, which uses a prediction of future possible frequent itemsets to reduce the number of times the original database needs to be scanned when previous small itemsets become large after database update.作者: SLAY 時間: 2025-3-22 18:10
https://doi.org/10.1007/978-3-642-51536-1obability distribution, we show that there does exist such a characterization for DAGs in terms of the . of the given set of CIs. More precisely, we demonstrate that if the given set of CIs satisfies certain constraints, then it has a perfect DAG representation.作者: 針葉樹 時間: 2025-3-22 21:23 作者: Project 時間: 2025-3-23 03:16 作者: 事先無準(zhǔn)備 時間: 2025-3-23 07:24
The Galton-Watson Process: Analytic Methodsagents learn to maximize their expected profits by adjusting product prices and by optionally altering the quality of their goods. As detailed in the paper, we believe that our proposed strategy leads to improved performance for buyers and sellers, reduced communication load, and robust systems.作者: Self-Help-Group 時間: 2025-3-23 12:19 作者: 晚間 時間: 2025-3-23 14:32
https://doi.org/10.1007/978-3-642-51536-1ations, and is faster overall. Moreover, it provides a better facility for the application of genetic algorithms for continuous optimization problems. As an example, two multimodal functions are used to test the operators, and an adaptive GA in which size and range are varied is tested.作者: interlude 時間: 2025-3-23 18:06
Branching Processes and Neutral Evolutionhe input CIs set, and then we suggest an algorithm to remove redundancy from arbitrary input CIs set. The resulting set of CIs after such a ‘clean’ procedure is unique. The conflicting CIs can be easily identified and removed, if necessary, so as to construct the desired graphical structure.作者: Banquet 時間: 2025-3-24 00:52
0302-9743 es of Intelligence / Soci′et′e canadienne pour l’′etude d’intelligence par ordinateur. Attendees enjoy our typically Canadian - mosphere –hospitable and stimulating. The Canadian AI conference showcases the excellent research work done by Canadians, their international colleagues, and others choosin作者: 控制 時間: 2025-3-24 04:19 作者: Forsake 時間: 2025-3-24 07:13
A New Class of Branching Processesology Theorem Provers (PTTPS) as game playing engines. Although the game has a simple axiomatization over a small universe, adapting a PTTP to play a full game of Clue is not trivial. This paper illustrates solutions to problems encountered during this exercise, including some interesting computational rules of inference.作者: enlist 時間: 2025-3-24 11:39 作者: Lucubrate 時間: 2025-3-24 15:05 作者: 脾氣暴躁的人 時間: 2025-3-24 20:46 作者: 受傷 時間: 2025-3-25 00:51
Using Communicative Acts to Plan the Cinematographic Structure of Animationsrden. Jedes neue Konzept wird durch Beispiele, Abbildungen und Aufgaben begleitet, die ein schnelles Verstehen und übertragenauf eigene Problemstellungen erm?glichen.?978-3-662-49757-9978-3-662-49758-6作者: 我怕被刺穿 時間: 2025-3-25 05:12 作者: 新娘 時間: 2025-3-25 11:05 作者: CAMP 時間: 2025-3-25 15:01
Generalized Arc Consistency with Application to MaxCSP978-981-99-4598-6作者: Esalate 時間: 2025-3-25 16:00
Mining Incremental Association Rules with Generalized FP-Tree978-3-322-80247-7作者: colloquial 時間: 2025-3-25 22:26
Topic Discovery from Text Using Aggregation of Different Clustering Methods作者: 鍍金 時間: 2025-3-26 00:43
Construction of a Non-redundant Cover for Conditional Independencies978-3-322-88393-3作者: 賭博 時間: 2025-3-26 06:58
Using Inter-agent Trust Relationships for Efficient Coalition Formation978-3-642-52397-7作者: 分開如此和諧 時間: 2025-3-26 08:49 作者: JAUNT 時間: 2025-3-26 13:18 作者: 夜晚 時間: 2025-3-26 20:01 作者: 可觸知 時間: 2025-3-27 00:22
A Learning Algorithm for Buying and Selling Agents in Electronic Marketplacesmiconduc- tor technologies suggests the design of new computer programs. This trend towards more complex structures and increasingly sophisticated processes demands advanced simulators, such as fully three-dimensional tools for almost arbitrarily complicated geometries. With the increasing need for better mod978-3-7091-7372-5978-3-7091-6657-4作者: 男生戴手銬 時間: 2025-3-27 04:42
Transposition Table Driven Work Scheduling in Distributed Game-Tree Searchansfer, radiation, multi-component diffusion as well as stiff gas-phase chemical reactions. Numerical simulation of commercial AIXTRON. reactors (a horizontal tube reactor AIX 200 and a multiwafer Planetary Reactor. AIX 2000) have been performed to obtain better understanding and optimization of nit作者: 止痛藥 時間: 2025-3-27 07:20
Clue as a Testbed for Automated Theorem Provingvice example is simulated and the comparison with microscopic (Schr?dinger/Poisson) results is excellent. A DG prediction of a dipole in the poly gate near the poly/gate-oxide interface is also confirmed by microscopic simulation. Both . and . for MOS devices including SOI are shown.作者: 乏味 時間: 2025-3-27 10:03
The Task Rehearsal Method of Life-Long Learning: Overcoming Impoverished Data realization) and Noyce (manufacturable process) are recognized as its primary inventors. We will define these methods of realization as “nanomanufacturing technologies” — i.e. the materials, process and measurement tools and technologies that deliver the required scale, cost, reproducibility and re作者: Accommodation 時間: 2025-3-27 16:47 作者: initiate 時間: 2025-3-27 21:39 作者: 飛來飛去真休 時間: 2025-3-27 23:04
On the Role of Contextual Weak Independence in Probabilistic Inferencegen der h?heren Art, welches viele einzelne Versuche sind, k?nnen alsdann von jedem untersucht und geprüft werden ... [Die Durchführung der Versuche; der Verf.] kann nicht sorgf?ltig, emsig, streng, ja pedantisch genug vorgenommen werden ... [Die Ergebnisse der Versuche, also die; der Verf.] Materia作者: MILL 時間: 2025-3-28 03:24 作者: painkillers 時間: 2025-3-28 07:07 作者: 沐浴 時間: 2025-3-28 13:03 作者: 藥物 時間: 2025-3-28 17:57
https://doi.org/10.1007/978-1-4615-8155-0ncludes two types of mobile agents - consultants and specialists. When an agent system calls in AERO to help it with its exception handling, a consultant migrates to the host system and in turn calls in a number of specialists, who also migrate to the host system to handle to the required types of e作者: Lumbar-Stenosis 時間: 2025-3-28 21:14
The Galton-Watson Process: Analytic Methodsake into account the fact that multiple selling agents may offer the same good with different qualities. In our approach, buying agents learn to avoid the risk of purchasing low quality goods and to maximize their expected value of goods by dynamically maintaining sets of reputable sellers. Selling 作者: 謊言 時間: 2025-3-29 02:25
Krishna B. Athreya,Peter E. Neyally, a grid is superimposed over a region, and a graph search is used to find the optimal (minimal cost) path. The most common scenario is to use a grid of tiles and to search using A*. This paper discusses the tradeoffs for different grid representations and grid search algorithms. Grid representa作者: 詢問 時間: 2025-3-29 03:54
Multi-Type Branching Processes,e effective in the single-agent domain. This paper presents TDSAB, applying the ideas behind TDS parallelism to the MTD(f) algorithm. Results show that TDSAB gives comparable performance to that achieved by conventional parallel αβ algorithms. This result is very encouraging, given that traditional 作者: STERN 時間: 2025-3-29 10:37 作者: 高射炮 時間: 2025-3-29 12:09
Jean-Pierre Dion,Belkheir Essebbarblems is to learn the input-output functionality from examples. However, in such situations it is not known which information is relevant to the task at hand. In this paper we focus on selection of relevant examples. We propose a new noise elimination method which is based on the filtering of the so作者: essential-fats 時間: 2025-3-29 16:44
https://doi.org/10.1007/978-3-642-52115-7e of inductive bias. This inductive bias enables TRM to generate more accurate hypotheses for new tasks that have small sets of training examples. TRM has a knowledge retention phase during which the neural network representation of a successfully learned task is stored in a domain knowledge databas作者: 高談闊論 時間: 2025-3-29 20:26 作者: 昏睡中 時間: 2025-3-30 03:18
Lecture Notes in Biomathematics combinatorial problems. In such a language one writes function-free logic programs with negation. Such a program is instantiated to a ground program and its stable models are computed. In this paper, we identify a class of logic programs for which the current techniques in solving SAT problems can 作者: Gourmet 時間: 2025-3-30 07:35 作者: Endearing 時間: 2025-3-30 10:04
Embeddings in Branching Processes,esting association rules may also appear..Existing association rules maintenance algorithms are Apriori-like, which mostly need to scan the entire database several times in order to update the previously computed frequent or large itemsets, and in particular, when some previous small itemsets become作者: 原來 時間: 2025-3-30 12:49
Branching Processes and Neutral Evolutionroposes a novel un-supervised learning approach based on aggregation of clusterings produced by different clustering techniques. By examining and combining two different clusterings of a document collection, the aggregation aims at revealing a better structure of the data rather than imposing one th作者: Infusion 時間: 2025-3-30 18:00
https://doi.org/10.1007/978-3-642-51536-1l arguments are real numbers this implies a fixed point encoding and decoding each time an argument is updated. A method is presented here for applying these operators to floating point numbers directly, eliminating the need for bit strings The result accurately models the equivalent bit string oper作者: 縱火 時間: 2025-3-30 21:12 作者: 滔滔不絕地說 時間: 2025-3-31 03:07 作者: placebo-effect 時間: 2025-3-31 06:37 作者: alcohol-abuse 時間: 2025-3-31 09:49
Branching Processes and Neutral Evolution system. We present a coalition formation mechanism designed at agent level and analyzed at both system and agent levels. Evaluation has been conducted to compare agent strategies (individual vs. social) and to analyze the system behavior under different circumstances. Our results show that the coal作者: AMITY 時間: 2025-3-31 15:00
https://doi.org/10.1007/3-540-47922-8AI-logics; Bayesian network; agent-based systems; agents; algorithmic learning; artificial intelligence; c作者: 突變 時間: 2025-3-31 19:47 作者: 無聊的人 時間: 2025-4-1 01:18
Advances in Artificial Intelligence978-3-540-47922-2Series ISSN 0302-9743 Series E-ISSN 1611-3349
