نتایج جستجو برای: prop erty ea

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

Journal: :Journal of the Society of Materials Engineering for Resources of Japan 2017

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2023

In recent years, graph neural network (GNN) based approaches have emerged as a powerful technique to encode complex topological structure of crystal materials in an enriched repre- sentation space. These models are often supervised nature and using the property-specific training data, learn relation- ship between different properties like formation energy, bandgap, bulk modulus, etc. Most these...

1989
Neil Immerman

Computational complexity began with the natural physical notions of time and space Given a property S an important issue is the computational complexity of checking whether or not an input satis es S For a long time the notion of complexity referred to the time or space used in the compu tation A mathematician might ask What is the complexity of expressing the property S It should not be surpri...

1995
Uri Abraham

An approach to proving higher level properties of distributed protocols is suggested here in which a proof consists of two stages: In the higher-level stage, abstract properties of system executions are assumed and their desired consequences are proved. At the lower-level stage these abstract properties are shown to hold in every execution of the protocol. The paper studies the Bakery Algorithm...

2017
Daniel Altman Catherine Greenhill Mikhail Isaev Reshma Ramadurai

Let G(n, r, s) denote a uniformly random r-regular s-uniform hypergraph onn vertices, where s is a fixed constant and r = r(n) may grow with n. An `-overlapping Hamilton cycle is a Hamilton cycle in which successive edges overlapin precisely ` vertices, and 1-overlapping Hamilton cycles are called loose Hamiltoncycles.When r, s ≥ 3 are fixed integers, we establish a thre...

Journal: :Logical Methods in Computer Science 2008
Myrto Arapinis Stéphanie Delaune Steve Kremer

The design and verification of cryptographic protocols is a notoriously difficulttask, even in symbolic models which take an abstract view of cryptography. This is mainlydue to the fact that protocols may interact with an arbitrary attacker which yields averification problem that has several sources of unboundedness (size of messages, numberof sessions, etc.).In this paper, ...

2006
Stephen J. Cook Colin E. Dunn

Ef fec tive min eral ex plo ra tion in the Nechako Pla teau and ad join ing re gions of cen tral Brit ish Co lum bia has for many years been hin dered by thick for est cover, an ex ten sive blan ket of till and other gla cial de pos its and, lo cally, wide spread Ter tiary ba salt cover. Where un der taken, re gional till and lake sed i ment geo chem i cal sur veys have been ef fec tive as re c...

1994
Ke Wang Weining Zhang

A nice property of the semi naive evaluation of recursive rules is that it does not repeat rule rings in di erent iterations In a recent study W however it was observed that intermediate steps during a rule ring may be repeated in di erent iterations and a notion of the step wise semi naive property and an evaluation with this property were proposed to capture the semi naive prop erty at interm...

1997
Olli-Matti Penttinen Tino Pyssysalo Leo Ojala

In this pap erwe study the performance of an adap tive vide o on demand V OD system In this system channel resources are allocated more e ciently than in full VOD or ne ar VOD in which a separate channel is allocated for each user or a xed set of movies is played at regular time intervals resp ectively In adaptive VOD one channel can be allocated for sev eral users bunching property and users r...

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

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