Sciweavers

2485 search results - page 250 / 497
» Time Bounded Frequency Computations
Sort
View
ERSHOV
2006
Springer
14 years 39 min ago
An ASM Semantics of Token Flow in UML 2 Activity Diagrams
Abstract. The token flow semantics of UML 2 activity diagrams is formally defined using Abstract State Machines. Interruptible activity regions and multiplicity bounds for pins are...
Stefan Sarstedt, Walter Guttmann
HPCA
1995
IEEE
13 years 12 months ago
Access Ordering and Memory-Conscious Cache Utilization
As processor speeds increase relative to memory speeds, memory bandwidth is rapidly becoming the limiting performance factor for many applications. Several approaches to bridging ...
Sally A. McKee, William A. Wulf
ECAI
2008
Springer
13 years 10 months ago
New Results for Horn Cores and Envelopes of Horn Disjunctions
We provide a characterization of Horn cores for formulas in conjunctive normal form (CNF) and, based on it, a novel algorithm for computing Horn cores of disjunctions of Horn CNFs ...
Thomas Eiter, Kazuhisa Makino
FLAIRS
2004
13 years 9 months ago
Package Planning with Graphical Models
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
Yang Xiang, Michael Janzen
CCCG
1998
13 years 9 months ago
Proximity drawings of binary trees in polynomial area
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
Paolo Penna, Paola Vocca