Sciweavers

4099 search results - page 45 / 820
» First Class Patterns
Sort
View
JMLC
2000
Springer
14 years 12 days ago
Composable Message Semantics in Oberon
Most object-oriented languages offer a limited number of invocation semantics. At best, they define a default mode of synchronous invocation, plus some keywords to express addition...
Markus Hof
WADS
2001
Springer
126views Algorithms» more  WADS 2001»
14 years 1 months ago
On External-Memory Planar Depth First Search
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
FUIN
2007
135views more  FUIN 2007»
13 years 8 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner
QUESTA
2002
38views more  QUESTA 2002»
13 years 8 months ago
Two-Class Priority Queueing System with State-Dependent Arrivals
In this paper, we present a performance analysis of a 2-dimensional preemptive priority queueing system with state-dependent arrivals. Using a Markovian formulation we first comput...
Gabriel R. Bitran, René Caldentey
DIS
2007
Springer
14 years 23 days ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono