Sciweavers

125 search results - page 11 / 25
» Model Theory Makes Formulas Large
Sort
View
ICFEM
2009
Springer
15 years 4 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
IJCAI
2001
14 years 10 months ago
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
Alan M. Frisch, Timothy J. Peugniez
INFOCOM
2009
IEEE
15 years 4 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu
VL
2002
IEEE
107views Visual Languages» more  VL 2002»
15 years 2 months ago
Reasoning about Many-to-Many Requirement Relationships in Spreadsheets
To help improve the reliability of spreadsheets created by end users, we are working to allow users to communicate the purpose and other underlying information about their spreads...
Laura Beckwith, Margaret M. Burnett, Curtis R. Coo...
CIVR
2008
Springer
166views Image Analysis» more  CIVR 2008»
14 years 11 months ago
A probabilistic ranking framework using unobservable binary events for video search
Recent content-based video retrieval systems combine output of concept detectors (also known as high-level features) with text obtained through automatic speech recognition. This ...
Robin Aly, Djoerd Hiemstra, Arjen P. de Vries, Fra...