Sciweavers

2989 search results - page 56 / 598
» Using Domain-Independent Problems for Introducing Formal Met...
Sort
View
ISCC
2002
IEEE
147views Communications» more  ISCC 2002»
15 years 2 months ago
A new method for finding generalized frequent itemsets in generalized association rule mining
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
Kritsada Sriphaew, Thanaruk Theeramunkong
MOC
2000
126views more  MOC 2000»
14 years 9 months ago
Adaptive multilevel methods in space and time for parabolic problems-the periodic case
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...
J. B. Burie, M. Marion
ATAL
2008
Springer
14 years 11 months ago
Resource constrained distributed constraint optimization using resource constraint free pseudo-tree
The Distributed Constraint Optimization Problem (DCOP) is a fundamental formalism for multi-agent cooperation. A dedicated framework called Resource Constrained DCOP (RCDCOP) has ...
Toshihiro Matsui, Marius Silaghi, Katsutoshi Hiray...
FAC
2008
100views more  FAC 2008»
14 years 9 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
FORMATS
2007
Springer
15 years 3 months ago
Undecidability of Universality for Timed Automata with Minimal Resources
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...
Sara Adams, Joël Ouaknine, James Worrell