Sciweavers

    AWPN
    2008
    274views Algorithms» more  AWPN 2008»
    A Janus-Faced Net Component for the Prototyping of Open Systems
    13 years 11 months ago
    A Janus-Faced Net Component for the Prototyping of Open Systems
    Download  www.informatik.uni-hamburg.de
    We introduce a Janus-faced reference net component that presents the basis for the recursive composition of complex systems from open system units. We particularly focus on the ope...
    Matthias Wester-Ebbinghaus, Daniel Moldt
    claim paper
    Read More »
    AWPN
    2008
    249views Algorithms» more  AWPN 2008»
    Towards Synthesis of Petri Nets from General Partial Languages
    13 years 11 months ago
    Towards Synthesis of Petri Nets from General Partial Languages
    Download  sunsite.informatik.rwth-aachen.de
    In this paper we investigate synthesis of place/transition Petri nets from three different finite representations of infinite partial languages, generalizing previous results.
    Robert Lorenz
    claim paper
    Read More »
    AWPN
    2008
    272views Algorithms» more  AWPN 2008»
    Finding Cost-Efficient Adapters
    13 years 11 months ago
    Finding Cost-Efficient Adapters
    Download  sunsite.informatik.rwth-aachen.de
    When adapting services in a SOA environment, not only the validity of the adapter may be of importance, but also non-functional properties like the costs of the adapter. We introdu...
    Christian Gierds
    claim paper
    Read More »
    AWPN
    2008
    273views Algorithms» more  AWPN 2008»
    An Approach to Tackle Livelock-Freedom in SOA
    13 years 11 months ago
    An Approach to Tackle Livelock-Freedom in SOA
    Download  wwwteo.informatik.uni-rostock.de
    We calculate a fixed finite set of state space fragments for a service P, where each fragment carries a part of the whole behavior of P. By composing these fragments according to t...
    Christian Stahl, Karsten Wolf
    claim paper
    Read More »
    AWPN
    2008
    238views Algorithms» more  AWPN 2008»
    Transient Analysis of Stochastic Petri Nets With Interval Decision Diagrams
    13 years 11 months ago
    Transient Analysis of Stochastic Petri Nets With Interval Decision Diagrams
    Download  ftp.informatik.rwth-aachen.de
    Martin Schwarick
    claim paper
    Read More »
    AWPN
    2008
    232views Algorithms» more  AWPN 2008»
    Synthesis of Petri Nets from Infinite Partial Languages with VipTool
    13 years 11 months ago
    Synthesis of Petri Nets from Infinite Partial Languages with VipTool
    Download  www.fernuni-hagen.de
    Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
    Robin Bergenthum, Sebastian Mauser
    claim paper
    Read More »
    ALENEX
    2007
    126views Algorithms» more  ALENEX 2007»
    0/1 Vertex and Facet Enumeration with BDDs
    13 years 11 months ago
    0/1 Vertex and Facet Enumeration with BDDs
    Download  www.mpi-inf.mpg.de
    In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...
    Markus Behle, Friedrich Eisenbrand
    claim paper
    Read More »
    ALENEX
    2007
    127views Algorithms» more  ALENEX 2007»
    Intersection in Integer Inverted Indices
    13 years 11 months ago
    Intersection in Integer Inverted Indices
    Download  siam.org
    Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...
    Peter Sanders, Frederik Transier
    claim paper
    Read More »
    ALENEX
    2007
    86views Algorithms» more  ALENEX 2007»
    In Transit to Constant Time Shortest-Path Queries in Road Networks
    13 years 11 months ago
    In Transit to Constant Time Shortest-Path Queries in Road Networks
    Download  algo2.iti.kit.edu
    Holger Bast, Stefan Funke, Domagoj Matijevic, Pete...
    claim paper
    Read More »
    ALENEX
    2007
    158views Algorithms» more  ALENEX 2007»
    Faster Filters for Approximate String Matching
    13 years 11 months ago
    Faster Filters for Approximate String Matching
    Download  siam.org
    We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor...
    Juha Kärkkäinen, Joong Chae Na
    claim paper
    Read More »
    « first‹ previous…204205206207208209210211212…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.