Sciweavers

9842 search results - page 168 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
PVLDB
2010
168views more  PVLDB 2010»
13 years 8 months ago
Active Complex Event Processing: Applications in Real-Time Health Care
Our analysis of many real-world event based applications has revealed that existing Complex Event Processing technology (CEP), while effective for efficient pattern matching on e...
Di Wang, Elke A. Rundensteiner, Richard Ellison, H...
CEC
2009
IEEE
13 years 8 months ago
Optimisation of the Beer Distribution Game with complex customer demand patterns
This paper examines a simulation of the Beer Distribution Game and a number of optimisation approaches to this game. This well known game was developed at MIT in the 1960s and has ...
Hongliang Liu, Enda Howley, Jim Duggan
DC
2010
13 years 5 months ago
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
Robert Danek, Wojciech M. Golab
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
14 years 2 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
ICLP
1997
Springer
14 years 2 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...