Sciweavers

1943 search results - page 80 / 389
» Ordering Default Theories
Sort
View
TYPES
2007
Springer
15 years 6 months ago
Dependently Sorted Logic
Abstract. We propose syntax and semantics for systems of intuitionistic and classical first order dependently sorted logic, with and withlity, retaining type dependency, but other...
João Filipe Belo
LION
2009
Springer
125views Optimization» more  LION 2009»
15 years 6 months ago
New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
Samuel Rota Bulò, Marcello Pelillo
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 12 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...
CDC
2008
IEEE
15 years 6 months ago
Robust invariant set theory applied to networked buffer-level control
— A manufacturer producing several items keeps them into safety stocks (buffers) in order to supply an external stochastic demand without interruptions. We consider the classical...
Francesco Borrelli, Carmen Del Vecchio, Alessandra...
SEMWEB
2007
Springer
15 years 6 months ago
OWL-CM: OWL Combining Matcher based on Belief Functions Theory
In this paper we propose a new tool called OWL-CM (OWL Combining Matcher) that deals with uncertainty inherent to ontology mapping process. On the one hand, OWL-CM uses the techniq...
Boutheina Ben Yaghlane, Najoua Laamari