Sciweavers

1404 search results - page 55 / 281
» Complexity of admissible rules
Sort
View
AIPS
2006
13 years 11 months ago
Towards Strong Cyclic Planning under Partial Observability
Strong Cyclic Planning aims at generating iterative plans that only allow loops so far as there is a chance to reach the goal. The problem is already significantly complex for ful...
Piergiorgio Bertoli, Alessandro Cimatti, Marco Pis...
COMCOM
2010
112views more  COMCOM 2010»
13 years 10 months ago
Birkhoff-von Neumann switching with statistical traffic profiles
Offline scheduling is attractive when the traffic profile is known a priori since the complexity of online scheduling is largely removed. Given any admissible rate matrix = (ij),...
Jerry Chi-Yuan Chou, Bill Lin
DEXAW
2005
IEEE
96views Database» more  DEXAW 2005»
14 years 3 months ago
Mining Complex Patterns from Protein Surfaces
In the domain of bioinformatics, the role played in the biological process by proteins, that act as transmitters and receivers of information thus ruling the mechanisms that deter...
Lorenzo Baldacci, Matteo Golfarelli
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
14 years 3 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
RSFDGRC
2005
Springer
134views Data Mining» more  RSFDGRC 2005»
14 years 3 months ago
The Computational Complexity of Inference Using Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
Cory J. Butz, Wen Yan, Boting Yang