Results 1  10
of
823,784
on Modeling of Branching Structures of Plants
, 2000
"... Previous studies of branching structures generally focused on arteries. Four cost models minimizing total surface area, total volume, total drag and total power losses at a junction point have been proposed to study branching structures. In this paper, we highlight the branching structures of plants ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Previous studies of branching structures generally focused on arteries. Four cost models minimizing total surface area, total volume, total drag and total power losses at a junction point have been proposed to study branching structures. In this paper, we highlight the branching structures
A study of branch prediction strategies
 In Proceedings of the 8th annual symposium on Computer Architecture
"... In highperformance computer systems. performance losses due to conditional branch instructrons can be minrmized by predicting a branch outcome and fetching, decoding, and/or issuing subsequent instructions before the actual outcome is known. This paper discusses branch prediction strategies wrth th ..."
Abstract

Cited by 478 (16 self)
 Add to MetaCart
In highperformance computer systems. performance losses due to conditional branch instructrons can be minrmized by predicting a branch outcome and fetching, decoding, and/or issuing subsequent instructions before the actual outcome is known. This paper discusses branch prediction strategies wrth
On Minkowskian Branching Structures
, 706
"... Contrary to its initial idea, Belnap’s (1992) theory of Branching SpaceTimes (BST) has models in which histories do not resemble relativistic spacetimes or any other physical spacetimes. The aim of this paper is to define a certain class of BST models, called ”Minkowskian Branching Structures ” ( ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Contrary to its initial idea, Belnap’s (1992) theory of Branching SpaceTimes (BST) has models in which histories do not resemble relativistic spacetimes or any other physical spacetimes. The aim of this paper is to define a certain class of BST models, called ”Minkowskian Branching Structures
Interactive Modeling of Branching Structures
 SIGGRAPH 96 Visual Proceedings
, 1996
"... We present a rule based modelling system that allows the graphical interactive definition of botanical structures such as plants, including partial and global constraints and free form deformations. The main idea is to represent the rule system by a structure tree with components of high functionali ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
functionality. In comparison to other rule based approaches, complex branching structures can be developed faster and more flexible. The design of natural objects such as trees, bushes or flowers is a challenging task in two respects. One is the enormous structural complexity, the other is the large amount
DecisionTheoretic Planning: Structural Assumptions and Computational Leverage
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 1999
"... Planning under uncertainty is a central problem in the study of automated sequential decision making, and has been addressed by researchers in many different fields, including AI planning, decision analysis, operations research, control theory and economics. While the assumptions and perspectives ..."
Abstract

Cited by 510 (4 self)
 Add to MetaCart
related methods, showing how they provide a unifying framework for modeling many classes of planning problems studied in AI. It also describes structural properties of MDPs that, when exhibited by particular classes of problems, can be exploited in the construction of optimal or approximately optimal policies
Large margin methods for structured and interdependent output variables
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2005
"... Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses the complementary ..."
Abstract

Cited by 612 (12 self)
 Add to MetaCart
the complementary issue of designing classification algorithms that can deal with more complex outputs, such as trees, sequences, or sets. More generally, we consider problems involving multiple dependent output variables, structured output spaces, and classification problems with class attributes. In order
Fast Folding and Comparison of RNA Secondary Structures (The Vienna RNA Package)
"... Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and bas ..."
Abstract

Cited by 812 (119 self)
 Add to MetaCart
Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions
Theory of the Firm: Managerial Behavior, Agency Costs and Ownership Structure
, 1976
"... This paper integrates elements from the theory of agency, the theory of property rights and the theory of finance to develop a theory of the ownership structure of the firm. We define the concept of agency costs, show its relationship to the ‘separation and control’ issue, investigate the nature of ..."
Abstract

Cited by 2780 (12 self)
 Add to MetaCart
This paper integrates elements from the theory of agency, the theory of property rights and the theory of finance to develop a theory of the ownership structure of the firm. We define the concept of agency costs, show its relationship to the ‘separation and control’ issue, investigate the nature
Fusion, Propagation, and Structuring in Belief Networks
 ARTIFICIAL INTELLIGENCE
, 1986
"... Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used to repre ..."
Abstract

Cited by 482 (8 self)
 Add to MetaCart
with the task of fusing and propagating the impacts of new information through the networks in such a way that, when equilibrium is reached, each proposition will be assigned a measure of belief consistent with the axioms of probability theory. It is shown that if the network is singly connected (e.g. treestructured
A semantics of multiple inheritance
 Information and Computation
, 1988
"... There are two major ways of structuring data in programming languages. The first and common one, used for example in Pascal, can be said to derive from standard branches of mathematics. Data is organized as cartesian products (i.e. record types), disjoint sums (i.e. unions or variant types) and func ..."
Abstract

Cited by 542 (10 self)
 Add to MetaCart
There are two major ways of structuring data in programming languages. The first and common one, used for example in Pascal, can be said to derive from standard branches of mathematics. Data is organized as cartesian products (i.e. record types), disjoint sums (i.e. unions or variant types
Results 1  10
of
823,784