text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
The the principle formulated. world is perceived of of relativity | The principle of the relativity of perceived world is formulated. | 5,800 |
which consider the We models linear mixed in observations grouped. are | We consider linear mixed models in which the observations are grouped. | 5,801 |
the a assets dependency-based game. relationships between depicts of the It | It depicts the dependency-based relationships between the assets of a game. | 5,802 |
arsenal an weapons. he can player example, construct a must build before For | For example, a player must construct an arsenal before he can build weapons. | 5,803 |
This graph improve balancing. paper helps the to game dependency that exhibits parallel | This paper exhibits that the parallel dependency graph helps to improve game balancing. | 5,804 |
the But, many models decisions. important include such aspects expert are to failed of | But, many such models are failed to include important aspects of the expert decisions. | 5,805 |
decision rules. to it is Therefore, essential the minimize | Therefore, it is essential to minimize the decision rules. | 5,806 |
standard clique the tree is in networks. method doing algorithm for Bayesian inference The | The clique tree algorithm is the standard method for doing inference in Bayesian networks. | 5,807 |
in manipulating by potentials - over the clique It variables distributions a works clique. | It works by manipulating clique potentials - distributions over the variables in a clique. | 5,808 |
viewed known Many approximate this algorithms can of inference approach. instances be as | Many known approximate inference algorithms can be viewed as instances of this approach. | 5,809 |
the to improve quality gradually the Iterations are estimation. of used | Iterations are used to gradually improve the quality of the estimation. | 5,810 |
factored of We the POMDPs. are in for interested problem planning | We are interested in the problem of planning for factored POMDPs. | 5,811 |
networks. qualitative probabilistic abstractions as Qualitative of introduced networks belief Bayesian been have | Qualitative probabilistic networks have been introduced as qualitative abstractions of Bayesian belief networks. | 5,812 |
enhanced for finer present detail. qualitative of a formalism We networks level with an | We present an enhanced formalism for qualitative networks with a finer level of detail. | 5,813 |
we the application its to examples. Finally, by method illustrate some practical | Finally, we illustrate the method by its application to some practical examples. | 5,814 |
decision theory This qualitative for of purely paper version uncertainty. under a investigates Savage's making | This paper investigates a purely qualitative version of Savage's theory for decision making under uncertainty. | 5,815 |
to presents an paper dynamic decision time-critical modeling. This approach | This paper presents an approach to time-critical dynamic decision modeling. | 5,816 |
dynamic modeling time-critical diagram knowledge A the method is called influence and proposed. representation | A knowledge representation and modeling method called the time-critical dynamic influence diagram is proposed. | 5,817 |
The abstraction model. proposed the represent has approach the within ability to space-temporal | The proposed approach has the ability to represent space-temporal abstraction within the model. | 5,818 |
algorithm An is model construction of knowledge-based also the provided. outline | An outline of the knowledge-based model construction algorithm is also provided. | 5,819 |
scheme an recently was called are The introduced. that extracted mini-bucket elimination heuristics from approximation | The heuristics are extracted from an approximation scheme called mini-bucket elimination that was recently introduced. | 5,820 |
introduced The search. paper and it Branch-and-Bound within evaluated first the idea | The first paper introduced the idea and evaluated it within Branch-and-Bound search. | 5,821 |
within current the and evaluated further In search. the idea extended Best-First paper is | In the current paper the idea is further extended and evaluated within Best-First search. | 5,822 |
algorithm probabilistic for exact present a inference Bayesian networks. parallel I in | I present a parallel algorithm for exact probabilistic inference in Bayesian networks. | 5,823 |
proof exists for based calculus. a There refutation a complete on logic procedure resolution-style Possibilistic | There exists for Possibilistic logic a proof procedure based on a refutation complete resolution-style calculus. | 5,824 |
sensors. provided any This paper validating an by information presents for time algorithm probabilistic the | This paper presents an any time probabilistic algorithm for validating the information provided by sensors. | 5,825 |
network The of consists models. Bayesian system two | The system consists of two Bayesian network models. | 5,826 |
list faulty potentially of provides sensors. It a | It provides a list of potentially faulty sensors. | 5,827 |
sensors the plant. power been The of of validation has in algorithm temperature a tested | The algorithm has been tested in the validation of temperature sensors of a power plant. | 5,828 |
described The in are paper those literature. transformations different in this the from described | The transformations described in this paper are different from those described in the literature. | 5,829 |
particular, the In the principles latter congruence not. of former satisfies does the ordinal while | In particular, the former satisfies the principles of ordinal congruence while the latter does not. | 5,830 |
approach example. dynamic a is a contrasted with for simple network Bayesian Our medical | Our approach is contrasted with a dynamic Bayesian network for a simple medical example. | 5,831 |
the MDP and original be The solved efficiently. abstract approximates can more | The abstract MDP approximates the original and can be solved more efficiently. | 5,832 |
several which We discuss be good can generated in to ways macro-actions quality. solution ensure | We discuss several ways in which macro-actions can be generated to ensure good solution quality. | 5,833 |
the backward the to algorithms. lead Both KL-divergence and inefficient KL-divergence | Both the KL-divergence and the backward KL-divergence lead to inefficient algorithms. | 5,834 |
mean may have For networks, large rely to one field approximations. however, on | For large networks, however, one may have to rely on mean field approximations. | 5,835 |
aggregation local Even rule probability conditions weaker out within tables. conditional | Even weaker conditions rule out local aggregation within conditional probability tables. | 5,836 |
procedure network. consensus This suggests a for straightforward a constructing Markov | This suggests a straightforward procedure for constructing a consensus Markov network. | 5,837 |
describe concepts There information not observations are that the from we extract to made. two | There are two concepts that we describe to extract information from the observations not made. | 5,838 |
to likely others. be more if are First, before present, reported some symptoms, | First, some symptoms, if present, are more likely to be reported before others. | 5,839 |
that there a Thus, desirable are reporting toward symptoms present. is bias | Thus, there is a desirable bias toward reporting symptoms that are present. | 5,840 |
significantly improve concepts inference. a develop simple diagnostic model can for We that these | We develop a simple model for these concepts that can significantly improve diagnostic inference. | 5,841 |
with method efficiency lazy evaluation examples. based emphasized The through is improvements obtained the | The efficiency improvements obtained with the lazy evaluation based method is emphasized through examples. | 5,842 |
framework We reasoning. presented the also probabilistic to compare other first-order with approaches | We also compare the presented framework with other approaches to first-order probabilistic reasoning. | 5,843 |
ever-increasing of There managing for uncertainty. procedures an is available variety | There is available an ever-increasing variety of procedures for managing uncertainty. | 5,844 |
these microcircuits differences unknown. of The in is synaptic structural cause | The cause of these structural differences in synaptic microcircuits is unknown. | 5,845 |
synapses. both including for depressing This heterogeneous networks and holds facilitating | This holds for heterogeneous networks including both facilitating and depressing synapses. | 5,846 |
proposed the validation suggest experiments the of for mechanism. further We | We further suggest experiments for the validation of the proposed mechanism. | 5,847 |
preference of automated form tools. component representations importnat Such decision an orderings of qualitative | Such representations of qualitative preference orderings form an importnat component of automated decision tools. | 5,848 |
arguably a is natural. compact and ofetn representation Such | Such a representation is ofetn compact and arguably natural. | 5,849 |
network with work construction. and situation-specific previous paper network This extends fragments | This paper extends previous work with network fragments and situation-specific network construction. | 5,850 |
the formally a conditional alternative for We table. an probability network, asymmetry define representation | We formally define the asymmetry network, an alternative representation for a conditional probability table. | 5,851 |
partially present asymmetry networks. We for also representation object-oriented an specified | We also present an object-oriented representation for partially specified asymmetry networks. | 5,852 |
parsimonious. the representation We show that is | We show that the representation is parsimonious. | 5,853 |
illustration. an transmission An is used to application as education | An application to education transmission is used as an illustration. | 5,854 |
In suggest paper, use we in contextual weak Bayesian independence (CWI) this the of networks. | In this paper, we suggest the use of contextual weak independence (CWI) in Bayesian networks. | 5,855 |
marginalizes qualitative to contribute nodes first the ambiguous approach that relationships. incrementally The | The first approach incrementally marginalizes nodes that contribute to the ambiguous qualitative relationships. | 5,856 |
types we for of three classes, these provide HPPs. For results | For these classes, we provide three types of results for HPPs. | 5,857 |
compute First, the we set HPP. all an develop algorithms of ground of consequences to | First, we develop algorithms to compute the set of all ground consequences of an HPP. | 5,858 |
consistency is P input, ("Given consistent? and an HPP as P | and consistency ("Given an HPP P as input, is P consistent? | 5,859 |
process exponentially evolves. that as show a belief error the the We state in contracts | We show that the error in a belief state contracts exponentially as the process evolves. | 5,860 |
process our bounded multiple remains error indefinitely. Thus, in with the even approximations, | Thus, even with multiple approximations, the error in our process remains bounded indefinitely. | 5,861 |
elicitation. utility We application the techniques investigate to of classification | We investigate the application of classification techniques to utility elicitation. | 5,862 |
a it user. Thus necessary for is model to new elicit utility separately each | Thus it is necessary to elicit a utility model separately for each new user. | 5,863 |
is decomposable. not is tedious, large Elicitation and the and if particularly outcome long space | Elicitation is long and tedious, particularly if the outcome space is large and not decomposable. | 5,864 |
approaches two utility to elicitation. common function are There | There are two common approaches to utility function elicitation. | 5,865 |
this clusters minimize of distance by utility measure. do appropriate an We functions identifying that | We do this by identifying clusters of utility functions that minimize an appropriate distance measure. | 5,866 |
are complexity, this practical in difficult of to medial skeletons applications. use Because | Because of this complexity, medial skeletons are difficult to use in practical applications. | 5,867 |
is energy in The building. first saving the | The first is energy saving in the building. | 5,868 |
this population to present dynamics a model We address question. | We present a population dynamics model to address this question. | 5,869 |
independence. definitions of Walley's addresses irrelevance these and This questions through paper | This paper addresses these questions through Walley's definitions of irrelevance and independence. | 5,870 |
decision framework a axiomatic under presents finite uncertainty setting. paper an for qualitative in This | This paper presents an axiomatic framework for qualitative decision under uncertainty in a finite setting. | 5,871 |
(or sup-min integral. a fuzzy) called is corresponding The utility Sugeno expressed expression, by | The corresponding utility is expressed by a sup-min expression, called Sugeno (or fuzzy) integral. | 5,872 |
conflicts analysis in-depth are incurred frameworks of by an integrated without viable No uncertainties. | No integrated frameworks are viable without an in-depth analysis of conflicts incurred by uncertainties. | 5,873 |
model uncertainty. theory definite Our to extends argumentation framework | Our framework extends definite argumentation theory to model uncertainty. | 5,874 |
and uncertain three supports It conflicting knowledge. over views | It supports three views over conflicting and uncertain knowledge. | 5,875 |
conclusions different depending Thus, on the engineers draw context knowledge can (i.e. application | Thus, knowledge engineers can draw different conclusions depending on the application context (i.e. | 5,876 |
as in are crucial awareness. real-world These aspects domains such battlefield | These aspects are crucial in real-world domains such as battlefield awareness. | 5,877 |
SPOOK, limitations. present In this these we implemented addresses paper, that an system | In this paper, we present SPOOK, an implemented system that addresses these limitations. | 5,878 |
In paper preference we case-based the alleviating to bottleneck. approach propose a this elicitation | In this paper we propose a case-based approach to alleviating the preference elicitation bottleneck. | 5,879 |
provide for computational measures. We all techniques three | We provide computational techniques for all three measures. | 5,880 |
present of situation-specific networks. definitions completeness We query and | We present definitions of query completeness and situation-specific networks. | 5,881 |
the knowledge base describe that conditions on guarantee query We completeness. | We describe conditions on the knowledge base that guarantee query completeness. | 5,882 |
to earlier work work The our relationship KBMC also of on discussed. is | The relationship of our work to earlier work on KBMC is also discussed. | 5,883 |
?missing' characterized These information. are by essentially | These are essentially characterized by ?missing' information. | 5,884 |
complex with the phenomenon a phenotype is interacts where Development environmental genetic forming and inputs. | Development is a complex phenomenon where the forming phenotype interacts with genetic and environmental inputs. | 5,885 |
development investigated. for has developmental an their model thoroughly important studies and Teeth been are | Teeth are an important model for developmental studies and their development has been thoroughly investigated. | 5,886 |
decision tool Influence powerful serve for as problems. modelling symmetric a diagrams | Influence diagrams serve as a powerful tool for modelling symmetric decision problems. | 5,887 |
influence set diagram we for an decisions involved. solving a determine When the of strategies | When solving an influence diagram we determine a set of strategies for the decisions involved. | 5,888 |
in A over a is its a past. function decision for strategy variable principle | A strategy for a decision variable is in principle a function over its past. | 5,889 |
welldefined. is the scenario that ensures This decision constraint | This constraint ensures that the decision scenario is welldefined. | 5,890 |
diagrams paper we In this partial with i.e. influence deal | In this paper we deal with partial influence diagrams i.e. | 5,891 |
partial temporal a only with diagrams specified. influence ordering | influence diagrams with only a partial temporal ordering specified. | 5,892 |
into decision problem these a is large, divided smaller pieces. stochastic approaches, In | In these approaches, a large, stochastic decision problem is divided into smaller pieces. | 5,893 |
examples are approach. illustrate provided A to of the number proposed | A number of examples are provided to illustrate the proposed approach. | 5,894 |
and interest logic representing for two frameworks knowledge. possibilistic Possibilistic bases graphs different of are | Possibilistic logic bases and possibilistic graphs are two different frameworks of interest for representing knowledge. | 5,895 |
graphs. possibilistic These two induce kinds two of conditioning of types | These two types of conditioning induce two kinds of possibilistic graphs. | 5,896 |
bases into In of translation cases, a possibilistic is graphs provided. both these | In both cases, a translation of these graphs into possibilistic bases is provided. | 5,897 |
knowledge from a The described. graph base is into translation min-based possibilistic a converse also | The converse translation from a possibilistic knowledge base into a min-based graph is also described. | 5,898 |
The such with models. is here work concerned acquiring presented | The work presented here is concerned with acquiring such models. | 5,899 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.