2485 search results - page 250 / 497 » Time Bounded Frequency Computations |
126
click to vote
ERSHOV
2006
Springer
15 years 7 months ago
2006
Springer
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...
117
click to vote
HPCA
1995
IEEE
15 years 7 months ago
1995
IEEE
As processor speeds increase relative to memory speeds, memory bandwidth is rapidly becoming the limiting performance factor for many applications. Several approaches to bridging ...
118
Voted
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
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 ...
145
click to vote
FLAIRS
2004
15 years 4 months ago
2004
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...
141
Voted
CCCG
1998
15 years 4 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...