Sciweavers

855 search results - page 3 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
LPNMR
2007
Springer
13 years 11 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 5 months ago
An LSB Data Hiding Technique Using Natural Numbers
In this paper, a novel data hiding technique is proposed, as an improvement over the Fibonacci LSB data-hiding technique proposed by Battisti et al. [1] based on decomposition of ...
Sandipan Dey, Ajith Abraham, Sugata Sanyal
JSCIC
2008
129views more  JSCIC 2008»
13 years 5 months ago
Level Set Equations on Surfaces via the Closest Point Method
Abstract Level set methods have been used in a great number of applications in R2 and R3 and it is natural to consider extending some of these methods to problems defined on surfac...
Colin B. Macdonald, Steven J. Ruuth
CP
1999
Springer
13 years 9 months ago
An Interval Constraint Approach to Handle Parametric Ordinary Differential Equations for Decision Support
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
Jorge Cruz, Pedro Barahona
FROCOS
2000
Springer
13 years 9 months ago
Handling Differential Equations with Constraints for Decision Support
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
Jorge Cruz, Pedro Barahona