Sciweavers

1139 search results - page 4 / 228
» Bounded Ideation Theory
Sort
View
LION
2009
Springer
125views Optimization» more  LION 2009»
14 years 2 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
ICALP
2010
Springer
13 years 7 months ago
Towards a Theory of Time-Bounded Verification
Abstract. We propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. We argue ...
Joël Ouaknine, James Worrell
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 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...
CSL
2004
Springer
14 years 1 months ago
A Third-Order Bounded Arithmetic Theory for PSPACE
We present a novel third-order theory W1 1 of bounded arithmetic suitable for reasoning about PSPACE functions. This theory has the advantages of avoiding the smash function symbol...
Alan Skelley
IWQOS
2004
Springer
14 years 1 months ago
Network calculus meets queueing theory -a simulation based approach to bounded queues
— Quality of Service (QoS) is an area with high academic curiosity. Our long-term goal is to develop a unified mathematical model. This paper is a first step towards this ambit...
Krishna Pandit, Jens Schmitt, Ralf Steinmetz