Sciweavers

4066 search results - page 58 / 814
» Almost Complete Sets
Sort
View
LPAR
2007
Springer
14 years 4 months ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki
ASWEC
2010
IEEE
13 years 10 months ago
Non-Monotonic Model Completion in Web Application Engineering
—Formal models are often used to verify systems and prove their correctness, and ensure that transformed models remain consistent to the original system. However, formal techniqu...
Jevon M. Wright, Jens Dietrich
CORR
2002
Springer
133views Education» more  CORR 2002»
13 years 9 months ago
Complete Axiomatizations for Reasoning About Knowledge and Time
Sound and complete axiomatizations are provided for a number of different logics involving modalities for knowledge and time. These logics arise from different choices for various ...
Joseph Y. Halpern, Ron van der Meyden, Moshe Y. Va...
CISS
2010
IEEE
13 years 1 months ago
Transmission completion time minimization in an energy harvesting system
Abstract—We consider the transmission completion time minimization problem in a single-user energy harvesting wireless communication system. In this system, both the data packets...
Jing Yang, Sennur Ulukus
ICIP
2007
IEEE
14 years 11 months ago
Automatic Parametrisation for an Image Completion Method Based on Markov Random Fields
Recently, a new exemplar-based method for image completion, texture synthesis and image inpainting was proposed which uses a discrete global optimization strategy based on Markov ...
Huy Tho Ho, Roland Göcke