1461 search results - page 252 / 293 » Complexity of Graph Covering Problems |
135
click to vote
FSTTCS
2010
Springer
14 years 11 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
153
click to vote
IFIP
2001
Springer
15 years 5 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
102
click to vote
ICPR
2004
IEEE
16 years 2 months ago
2004
IEEE
: Significant progress has been made by the computer vision community in recent years along two fronts: (i) developing complex spatial-temporal models for object registration and t...
121
click to vote
EDBT
2009
ACM
15 years 5 months ago
2009
ACM
Consider a scientist who wants to explore multiple data sets to select the relevant ones for further analysis. Since the visualization real estate may put a stringent constraint o...
122
click to vote
APIN
2006
15 years 1 months ago
2006
It is not an easy task to know a priori the most appropriate fuzzy sets that cover the domains of quantitative attributes for fuzzy association rules mining. In general, it is unre...