Sciweavers

1220 search results - page 14 / 244
» Minimal Interval Completions
Sort
View
AIML
2004
13 years 9 months ago
On Notions of Completeness Weaker than Kripke Completeness
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
Tadeusz Litak
IJCAI
1997
13 years 9 months ago
Minimum Splits Based Discretization for Continuous Features
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...
Ke Wang, Han Chong Goh
RTCSA
2005
IEEE
14 years 1 months ago
Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
Jian-Jia Chen, Jun Wu, Chi-Sheng Shih, Tei-Wei Kuo
LFCS
2007
Springer
14 years 1 months ago
Density Elimination and Rational Completeness for First-Order Logics
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
Agata Ciabattoni, George Metcalfe
ER
1999
Springer
108views Database» more  ER 1999»
13 years 12 months ago
Modeling Cyclic Change
Database support of time-varying phenomena typically assumes that entities change in a linear fashion. Many phenomena, however, change cyclically over time. Examples include monsoo...
Kathleen Hornsby, Max J. Egenhofer, Patrick J. Hay...