1355 search results - page 106 / 271 » Alternating Timed Automata over Bounded Time |
AMT
2006
Springer
13 years 11 months ago
2006
Springer
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
AUTOMATICA
2008
13 years 9 months ago
2008
This paper proposes a disturbance-based control parametrization under the Model Predictive Control framework for constrained linear discrete time systems with bounded additive dis...
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
HASE
2008
IEEE
14 years 3 months ago
2008
IEEE
Current annotation technologies suffer from poor coverage over the development process phases, limited support for the broad scope of the security requirement types and inadequate...