Sciweavers

5864 search results - page 309 / 1173
» Can We Work around Numerical Methods
Sort
View
ICFEM
2009
Springer
16 years 2 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He
SIGCSE
2009
ACM
193views Education» more  SIGCSE 2009»
16 years 8 months ago
Seattle: a platform for educational cloud computing
Cloud computing is rapidly increasing in popularity. Companies such as RedHat, Microsoft, Amazon, Google, and IBM are increasingly funding cloud computing infrastructure and resea...
Justin Cappos, Ivan Beschastnikh, Arvind Krishnamu...
FLAIRS
2008
15 years 9 months ago
Answer Set Programming on Expert Feedback to Populate and Extend Dynamic Ontologies
The next generation of online reference works will require structured representations of their contents in order to support scholarly functions such as semantic search, automated ...
Mathias Niepert, Cameron Buckner, Colin Allen
202
Voted
EDBT
2009
ACM
186views Database» more  EDBT 2009»
16 years 2 months ago
Automating the loading of business process data warehouses
Business processes drive the operations of an enterprise. In the past, the focus was primarily on business process design, modeling, and automation. Recently, enterprises have rea...
Malú Castellanos, Alkis Simitsis, Kevin Wil...
CADE
2009
Springer
16 years 8 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...