Filters








1,517 Hits in 6.7 sec

AN EXTENSION OF LAZY EVALUATION FOR INFLUENCE DIAGRAMS AVOIDING REDUNDANT VARIABLES IN THE POTENTIALS

MARTA VOMLELOVÁ, FINN V. JENSEN
2004 International Journal of Uncertainty Fuzziness and Knowledge-Based Systems  
doi:10.1142/s0218488504002552 fatcat:khr4mqwmq5df3pjegh54ez4yvq

Variable elimination for influence diagrams with super value nodes

Manuel Luque, Francisco Javier Díez
2010 International Journal of Approximate Reasoning  
In this paper we propose a variable-elimination algorithm for influence diagrams with super value nodes which is faster in most cases, requires less memory in general, introduces much fewer redundant (  ...  In the original formulation of influence diagrams (IDs), each model contained exactly one utility node.  ...  We would like to thank the reviewers of this paper and those of the Second European Workshop on Probabilistic Graphical Models (PGM-04) for many useful comments.  ... 
doi:10.1016/j.ijar.2009.11.004 fatcat:q3fymhyjijbzbknoyjztj7pbga

Advances in Decision Graphs [chapter]

Thomas D. Nielsen, Finn V. Jensen
2004 Studies in Fuzziness and Soft Computing  
In this paper we outline some of the recent advances by taking outset in the influence diagram framework.  ...  Moreover, we give a brief outline of recent contributions to methods for performing sensitivity analysis in influence diagrams.  ...  Evaluating decision problems Lazy evaluation of (partial) influence diagrams An influence diagram is solved through dynamic programming using Equation 2.  ... 
doi:10.1007/978-3-540-39879-0_8 fatcat:zgvsqtwvuzc3xmn45s7kji2k4y

Derflow

Manuel Bravo, Zhongmiao Li, Peter Van Roy, Christopher Meiklejohn
2014 Proceedings of the Thirteenth ACM SIGPLAN workshop on Erlang - Erlang '14  
. • Prototype implementation of a deterministic dataflow extension to Erlang called Derflow, with examples of its usage for common computations.  ...  This model is inherently non-deterministic: a process can receive messages sent by any process which knows its process identifier, leading to an exponential number of possible executions based on the number  ...  Acknowledgments We thank Nicholas Rutherford and Sean Cribbs for comments that helped to improve the paper. This  ... 
doi:10.1145/2633448.2633451 dblp:conf/erlang/BravoLRM14 fatcat:i6uicwwzojdnparvgtly7mx3tq

Performance of lazy combinator graph reduction

Pieter H. Hartel
1991 Software, Practice & Experience  
The results are valid for implementations of combinator graph reduction that use binary graphs.  ...  Performance gains of up to 11 × × are reported for target architectures on which each memory reference consumes one unit of time.  ...  Kieburtz, Keen Langendoen, Rob Milikowski, Wim Vree and the referees for their comments on drafts of the paper.  ... 
doi:10.1002/spe.4380210306 fatcat:32xplx7fmrab5ni5ayor2atkd4

Annotation-directed run-time specialization in C

Brian Grant, Markus Mock, Matthai Philipose, Craig Chambers, Susan J. Eggers
1997 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '97  
Our design is being implemented in the context of an existing optimizing compiler. * Polyvariant division allows the same program point to be analyzed for different combinations of variables being treated  ...  We present the design of a dynamic compilation system for C.  ...  in partial evaluation.  ... 
doi:10.1145/258993.259016 dblp:conf/pepm/GrantMPCE97 fatcat:7wmlgcqa2fahzkmd67l5qpd6qu

Annotation-directed run-time specialization in C

Brian Grant, Markus Mock, Matthai Philipose, Craig Chambers, Susan J. Eggers
1997 SIGPLAN notices  
Our design is being implemented in the context of an existing optimizing compiler. * Polyvariant division allows the same program point to be analyzed for different combinations of variables being treated  ...  We present the design of a dynamic compilation system for C.  ...  in partial evaluation.  ... 
doi:10.1145/258994.259016 fatcat:inzi7vkxtrcxlf7rxp3de3uf4q

Staged configuration through specialization and multilevel configuration of feature models

Krzysztof Czarnecki, Simon Helsen, Ulrich Eisenecker
2005 Software Process: Improvement and Practice  
In this paper, we propose a cardinality-based notation for feature modeling, which integrates a number of existing extensions of previous approaches.  ...  Feature modeling is a key technique for capturing commonalities and variabilities in system families and product lines.  ...  Acknowledgements We would like to thank Michal Antkiewicz for fruitful discussions about the metamodel presented in this paper.  ... 
doi:10.1002/spip.225 fatcat:rleck2qznndsxeauuvpvy4kjuu

Path planning with general end-effector constraints

Zhenwang Yao, Kamal Gupta
2007 Robotics and Autonomous Systems  
Generally, for a redundant robot, an end-effector pose, p, corresponds to a set of configurations in the C-space, the secalled self-motion manifold, denoted as SM(p).  ...  Joint variables for the active chain are generated randomly, and passive chain joint variables are computed as a non-redundant robot to satisfy the closure constraint.  ... 
doi:10.1016/j.robot.2006.11.004 fatcat:no52vu3bybacvhnrnm4olpfvnm

Adapting virtual machine techniques for seamless aspect support

Christoph Bockisch, Matthew Arnold, Tom Dinkelaker, Mira Mezini
2006 SIGPLAN notices  
This inefficiency has negative effects on the productivity of the development process and is especially prohibitive for dynamic aspect deployment.  ...  We also provide a detailed comparison of alternative implementations of execution environments with support for dynamic aspect deployment.  ...  Acknowledgments This work was supported by the AOSD-Europe Network of Excellence, European Union grant no. FP6-2003-IST-2-004349.  ... 
doi:10.1145/1167515.1167483 fatcat:n7jghma63zdtndhsecjc7jprey

Adapting virtual machine techniques for seamless aspect support

Christoph Bockisch, Matthew Arnold, Tom Dinkelaker, Mira Mezini
2006 Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications - OOPSLA '06  
This inefficiency has negative effects on the productivity of the development process and is especially prohibitive for dynamic aspect deployment.  ...  We also provide a detailed comparison of alternative implementations of execution environments with support for dynamic aspect deployment.  ...  Acknowledgments This work was supported by the AOSD-Europe Network of Excellence, European Union grant no. FP6-2003-IST-2-004349.  ... 
doi:10.1145/1167473.1167483 dblp:conf/oopsla/BockischADM06 fatcat:zc6eiwbmpvcjxkotpireqfciua

An Improvised k-NN Respecting Diversity of Data for Network Intrusion Detection

Yasir Hamid, Balasaraswathi Ranganathan, Ludovic Journaux, Qaiser Farooq, Sugumaran Muthukumarasamy
2017 International Journal of Intelligent Engineering and Systems  
As for this work is considered, we take into consideration both the categories of features simultaneously by replacing the conventional Euclidean metric with Gower metric, which is better suited for mixed  ...  In this work we have applied Synthetic Minority Oversampling Technique (SMOTE) to balance the dataset and eliminate the skewness of the class distribution.  ...  by controlling the influence of such variables of such features on the classification.  ... 
doi:10.22266/ijies2017.0630.46 fatcat:gnmmir2bbne27ihholyf3rfuuu

Taxation students' perceptions of open-book assessment prior to the qualifying examination of South African chartered accountants

H du Preez, C S du Preez
2012 South African Journal of Accounting Research  
Findings from the System Interrelationship Diagram indicated that students perceive good preparation as the strongest driver for successful completion of an open-book assessment.  ...  In this study taxation students' perceptions of open-book assessment, prior to their exposure to open-book assessment in the qualifying examination of South African chartered accountants, is explored.  ...  This is a specific reference to the idea that 20% of the variables in a system will account for 80% of the total variation in the outcomes of that system (Northcutt & McCoy, 2004) .  ... 
doi:10.1080/10291954.2012.11435166 fatcat:auldk4eairfy3ceiloi3pios5a

A Catalogue of Refactorings for Model-to-Model Transformations

Manuel Wimmer, Salvador Martínez, Frédéric Jouault, Jordi Cabot
2012 Journal of Object Technology  
In particular, we present a dedicated catalogue of refactorings for improving the quality of M2M transformations.  ...  In object-oriented programming, continuous refactorings are used as the main mechanism to increase the maintainability of the code base.  ...  Acknowledgments We would like to thank Marcel F. van Amstel for providing us the ATL2Metrics transformations which have been used for the computation of metric values for the different versions of the  ... 
doi:10.5381/jot.2012.11.2.a2 fatcat:2da4c2djcfenhc5rjzx4cb5koa

A fresh look at combinator graph reduction

P. J. Koopman, P. Lee
1989 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation - PLDI '89  
Furthermore, the mapping of TIGRE onto conventional hardware is simple and efficient.  ...  We present a new abstract machine for graph reduction called TIGRE.  ...  It provides for lazy function evaluation, and also lazy updating of the graph in memory by using registers to pass small portions of the tree between combinators.  ... 
doi:10.1145/73141.74828 dblp:conf/pldi/KoopmanL89 fatcat:ewks3dax3ra47bpmrpe2k4m4my
« Previous Showing results 1 — 15 out of 1,517 results