Sciweavers

9842 search results - page 1440 / 1969
» Problem complexity
Sort
View
ASWEC
2007
IEEE
16 years 1 months ago
Supporting OO Design Heuristics
Heuristics have long been recognised as a way to tackle problems which are intractable because of their size or complexity. They have been used in software engineering for purpose...
Neville Churcher, Sarah Frater, Cong Phuoc Huynh, ...
ICDE
2007
IEEE
179views Database» more  ICDE 2007»
16 years 1 months ago
A New ILP-based Concept Discovery Method for Business Intelligence
In this work, we propose a multi-relational concept discovery method for business intelligence applications. Multi-relational data mining finds interesting patterns that span ove...
Seda Daglar Toprak, Pinar Senkul, Yusuf Kavurucu, ...
BIOWIRE
2007
Springer
16 years 1 months ago
Epcast: Controlled Dissemination in Human-Based Wireless Networks Using Epidemic Spreading Models
Epidemics-inspired techniques have received huge attention in recent years from the distributed systems and networking communities. These algorithms and protocols rely on probabili...
Salvatore Scellato, Cecilia Mascolo, Mirco Musoles...
CAISE
2007
Springer
16 years 1 months ago
Analyzing the Dynamic Cost Factors of Process-Aware Information Systems: A Model-Based Approach
Introducing process-aware information systems (PAIS) in enterprises is usually associated with high costs. It is therefore crucial to understand those factors that determine these ...
Bela Mutschler, Manfred Reichert, Stefanie Rinderl...
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
16 years 1 months ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri
« Prev « First page 1440 / 1969 Last » Next »