4335 search results - page 806 / 867 » Ontology Engineering Relationally |
FSTTCS
2010
Springer
13 years 6 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...
VSTTE
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Theorem-prover based modular checkers have the potential to perform scalable and precise checking of user-defined properties by combining pathsensitive intraprocedural re...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of con...
CSMR
2010
IEEE
13 years 3 months ago
2010
IEEE
To avoid unnecessary maintenance costs in large IT systems resulting from poorly planned changes, it is essential to manage and control changes to the system and to verify that all...
SIAMCOMP
2011
13 years 3 months ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...