1,632 Hits in 3.9 sec

Generating Special-Purpose Stateless Propagators for Arbitrary Constraints [chapter]

Ian P. Gent, Chris Jefferson, Ian Miguel, Peter Nightingale
2010 Lecture Notes in Computer Science  
Propagation is so fast that, for constraints available in our solver, the generated propagator compares well with a human-optimised propagator for the same constraint.  ...  Given an arbitrary constraint c on n variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation that would be performed  ...  The algorithms we give herein generate GAC propagators for arbitrary constraints that run in time O(nd), in extreme cases an exponential factor faster than any table constraint propagator [4, 12, 7, 6  ... 
doi:10.1007/978-3-642-15396-9_19 fatcat:pzv6uhazsfb7vhh5eyk7xf5s4i

The Anatomy of a Sales Configurator: An Empirical Study of 111 Cases [chapter]

Ebrahim Khalil Abbasi, Arnaud Hubaux, Mathieu Acher, Quentin Boucher, Patrick Heymans
2013 Lecture Notes in Computer Science  
In many cases, configurators have become the single entry point for placing customer orders.  ...  The first part of this paper reports on a systematic study of 111 web sales configurators along three essential dimensions: rendering of configuration options, constraint handling, and configuration process  ...  We identified three patterns for dealing with mandatory options: Step-by-step 59% Full-step 41% Backward Navigation (58) Stateful arbitrary 69% Stateless arbitrary 14% Not supported 17% -Transition  ... 
doi:10.1007/978-3-642-38709-8_11 fatcat:ema35uigafaorfohtvs5o53r74

Model transformations and tool integration

Laurence Tratt
2005 Journal of Software and Systems Modeling  
In this paper I motivate the need for dedicated approaches to model transformations, particularly for the data involved in tool integration, outline the challenges involved, and then present a number of  ...  Recent attention on model transformations has particularly focused on the OMG's Queries / Views / Transformations (QVT) Request for Proposals (RFP).  ...  Acknowledgements I would particularly like to thank Tony Clark for his advice and encouragement over the past few years and for his reading of an early draft; Girish Maskeri also provided insightful comments  ... 
doi:10.1007/s10270-004-0070-1 fatcat:la6ztql2bjf5tjt6txd4pad4fq

A change propagating model transformation Language

Laurence Tratt
2008 Journal of Object Technology  
In this paper I outline the challenges presented by change propagating model transformations, before presenting a new change propagating model transformation approach.  ...  Change propagating model transformations are those which can make suitable updates to models after an initial transformation.  ...  This then allows tracing information to be used for other purposes.  ... 
doi:10.5381/jot.2008.7.3.a3 fatcat:xf2hlrcs7zeybiwp3a2t3kvdsa

Parallel architecture and compilation techniques

S. Bartolini, R. Giorgi, J. Protic, C. A. Prete, M. Valero
2001 SIGARCH Computer Architecture News  
For copyright reasons, we cannot include mll B  ...  As addressed by keynote speakers, the time has never been so propitious to explore the potentials of compilers on the architecture and vice versa, due to the strong demand for advances in the interaction  ...  Nakajima describes a new user interface system supporting flexible user interaction for networked home appliances.  ... 
doi:10.1145/563647.563651 fatcat:x24qebzmy5fq7b645icpmqf5aq

Generating custom propagators for arbitrary constraints

Ian P. Gent, Christopher Jefferson, Steve Linton, Ian Miguel, Peter Nightingale
2014 Artificial Intelligence  
Many constraints have efficient constraint-specific propagation algorithms. In this work, we generate custom propagators for constraints.  ...  Given an arbitrary constraint, we show how to generate a custom propagator that establishes GAC in small polynomial time.  ...  Acknowledgements We would like to thank anonymous reviewers for their helpful comments. This research was supported by EPSRC grants with numbers EP/H004092/1 and EP/E030394/1.  ... 
doi:10.1016/j.artint.2014.03.001 fatcat:pufj7ybntnenhb3fs5pjei6lna

Quantum instruments as a foundation for both states and observables

Justin Dressel, Andrew N. Jordan
2013 Physical Review A. Atomic, Molecular, and Optical Physics  
We demonstrate that quantum instruments can provide a unified operational foundation for quantum theory.  ...  Heisenberg and Schrödinger pictures of time evolution as applied to the various derived quantities, illustrate how detector loss can be included naturally, and discuss how the instrumental approach fully generalizes  ...  ACKNOWLEDGMENTS We thank Curtis Broadbent for suggesting the term "interdictive state." We acknowledge support from the National Science Foundation under Grant No.  ... 
doi:10.1103/physreva.88.022107 fatcat:gon4b75jcvbcjgddo7kbwhmpr4

A new deterministic traffic model for core-stateless scheduling

Gang Cheng, Li Zhu, N. Ansari
2006 IEEE Transactions on Communications  
With our proposed traffic model, performance analysis in core-stateless networks becomes straightforward.  ...  Index Terms-Core-stateless network, quality of service (QoS), traffic model, traffic scheduling. he was with NJIT.  ...  In reality, both buffers 1 and 2 do not exist; they are used here for illustrative purposes.  ... 
doi:10.1109/tcomm.2006.873091 fatcat:rrb2v6ztsvgo3aeimxmscn7dmy

Identification of Idiom Usage in C++ Generic Libraries

Andrew Sutton, Ryan Holeman, Jonathan I. Maletic
2010 2010 IEEE 18th International Conference on Program Comprehension  
Large C++ generic libraries are notorious for being extremely difficult to comprehend due to their use of advanced language features and idiomatic nature.  ...  These micropattern instances act as beacons for the idioms being identified. The method is applied to study a number of widely used open source C++ generic libraries.  ...  On the other hand, one purpose of generic libraries is to provide reusable and adaptable libraries for application developers.  ... 
doi:10.1109/icpc.2010.37 dblp:conf/iwpc/SuttonHM10 fatcat:dj4jc2s5xjf4bnoolwpzerznne

Hierarchical Dataflow Model with Automated File Management for Engineering and Scientific Applications

Alexey M. Nazarenko, Alexander A. Prokhorov
2015 Procedia Computer Science  
Acknowledgements Special thanks to our colleague A. Davydov for his invaluable help with the final text of this paper.  ...  This is a fairly generic function which can also be used in place of a stateless loop (where iterations do not depend on results of the previous ones).  ...  First, we can manage files using a general-purpose network filesystem that makes some directory with files accessible on all nodes executing a distributed workflow.  ... 
doi:10.1016/j.procs.2015.11.056 fatcat:wotdcbjx7jgh7gntkjdmm564om

Stochastic Dependability Analysis of System Architecture Based on UML Models [chapter]

István Majzik, András Pataricza, Andrea Bondavalli
2003 Lecture Notes in Computer Science  
We discuss the model refinement based on the General Resource Model, an extension of UML.  ...  It is to be used in the early phases of the system design to capture system dependability attributes like reliability and availability, thus providing guidelines for the choice among different architectural  ...  The general technological concept of VIATRA is the use of the XMI standard (for arbitrary MOF-based metamodel).  ... 
doi:10.1007/3-540-45177-3_10 fatcat:xe5uoc5ghfbtfgmqiusveddvfi

Control generation for embedded systems based on composition of modal processes

Pai Chou, Ken Hines, Kurt Partidge, Gaetano Borriello
1998 Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design - ICCAD '98  
This paper first describes a kernel-language representation for the high-level composition operators; it also presents a synthesis algorithm for the mode manager, the runtime code that maintains control  ...  for the purpose of propagating mode changes imperatively.  ...  The curried parameters in the functional definition of the primitive constraint allow us to specialize this for certain general applications.  ... 
doi:10.1145/288548.288559 dblp:conf/iccad/ChouHPB98 fatcat:z6gyyzrvfvbytp6jio24alk6vi

Control Generation for Embedded Systems Based on Composition of Modal Processes**This work was supported by PYI MIP-8858782, DARPA DAAH04-94-G-0272, and a Mentor fellowship [chapter]

Pai Chou, Ken Hines, Kurt Partridge, Gaetano Borriello
2002 Readings in Hardware/Software Co-Design  
This paper first describes a kernel-language representation for the high-level composition operators; it also presents a synthesis algorithm for the mode manager, the runtime code that maintains control  ...  for the purpose of propagating mode changes imperatively.  ...  The curried parameters in the functional definition of the primitive constraint allow us to specialize this for certain general applications.  ... 
doi:10.1016/b978-155860702-6/50031-4 fatcat:2bajrn4hdfetli5t4orcihfg2e

Consistent Network Management for Software-Defined Networking Based Multicast

Thomas Kohler, Frank Durr, Kurt Rothermel
2016 IEEE Transactions on Network and Service Management  
We present a generic management architecture allowing for an appropriate selection of an update mechanism and its parameters based on expected inconsistency effects.  ...  We present an update procedure for multicast routing updates that identifies critical update steps, which are fed back into the reconfiguration process, along with a lightweight approach that allows for  ...  In our extensive analysis, we then prove that in general it is impossible to avoid violation of two invariants, drop-and duplicate-freeness, for arbitrary multicast network updates using a stateless approach  ... 
doi:10.1109/tnsm.2016.2585672 fatcat:3w6frbgr3faq7irmeffimsvh4e

An In-Network Querying Framework for Wireless Sensor Networks

M. Demirbas, Xuming Lu, P. Singla
2009 IEEE Transactions on Parallel and Distributed Systems  
Moreover, due to its minimalist infrastructure and stateless nature, DQT shows graceful resilience to node failures and topology changes.  ...  DQT is distance sensitive for querying of an event: the cost of answering a query for an event is at most a constant factor ( 2 √ 2 in our case) of the distance "d" to the event of interest in the network  ...  To this end, DSIB introduces a costly bottom-up construction and a special purpose routing algorithm.  ... 
doi:10.1109/tpds.2008.217 fatcat:gytosmylkndencq7mhzdug3kki
« Previous Showing results 1 — 15 out of 1,632 results