نتایج جستجو برای: cerrobend blocks

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

Journal: :J. Log. Program. 1997
Robert A. Kowalski Fariba Sadri

In this paper, to compare the situation calculus and event calculus we formulate both as logic programs and prove properties of these by reasoning with their completions augmented with induction. We thus show that the situation calculus and event calculus imply one another. Whereas our derivation of the event calculus from the situation calculus requires the use of induction, our derivation of ...

2009
Ronny Hartanto Joachim Hertzberg

Keeping planning problems as small as possible is a must in order to cope with complex tasks and environments. Earlier, we have described a method for cascading Description Logic (dl) representation and reasoning on the one hand, and Hierarchical Task Network (htn) action planning on the other. The planning domain description as well as the fundamental htn planning concepts are represented in d...

2002
Hasan Çam

Orthogonal variable spreading factor (OVSF) codes are employed in the third generation (3G) wideband code division multiple access (WCDMA) wireless system as channelization codes. Any two OVSF codes of different tree levels are orthogonal if and only if one of two codes is not mother code of the other. This results in a major drawback of OVSF codes, called blocking property: when an OVSF code i...

Journal: :Communications in Algebra 2023

Let p be a prime number, k an algebraically closed field of characteristic p, G˜ finite group, and G normal subgroup having p-power index in G˜. Moreover let B block kG with cyclic defect group B˜ the unique kG˜ covering B. We study tilting complexes over show that is tilting-discrete algebra. we set all isomorphic to as partially ordered sets.

Journal: :Journal of Algebra 1976

Journal: :Genome Biology 2002

Journal: :Proceedings of the Imperial Academy 1938

1997
Eric B. Baum

A market-based algorithm is presented which autonomously apportions complex tasks to multiple cooperating agents giving each agent the motivation of improving performance of the whole system. A speciic model, called \The Hayek Machine" is proposed and tested on a simulated Blocks World (BW) planning problem. Hayek learns to solve more complex BW problems than any previous learning algorithm. Gi...

1996
Gilad Lifschytz

We calculate the potential between two different stationary D-branes and the velocity dependent potential between two different moving D-branes. We identify configurations with some unbroken supersymmetry, using a zero force condition. The potentials are compared with an eleven dimensional calculation of the scattering of a zero black-brane from the 0, 2, 4 and 6 black-brane of type IIA supergr...

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

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