Sciweavers

2233 search results - page 181 / 447
» On the Complexity of Theory Curbing
Sort
View
JCSS
2008
96views more  JCSS 2008»
15 years 6 months ago
A combinatorial characterization of resolution width
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
Albert Atserias, Víctor Dalmau
JLP
2006
126views more  JLP 2006»
15 years 6 months ago
Compositional modeling and refinement for hierarchical hybrid systems
In this paper, we develop a theory of modular design and refinement of hierarchical hybrid systems. In particular, we present compositional trace-based semantics for the language ...
Rajeev Alur, Radu Grosu, Insup Lee, Oleg Sokolsky
NN
2006
Springer
218views Neural Networks» more  NN 2006»
15 years 6 months ago
Modeling attention to salient proto-objects
Selective visual attention is believed to be responsible for serializing visual information for recognizing one object at a time in a complex scene. But how can we attend to objec...
Dirk Walther, Christof Koch
JCSS
2007
88views more  JCSS 2007»
15 years 6 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...
Denis Xavier Charles
ARTMED
2000
105views more  ARTMED 2000»
15 years 6 months ago
Planning treatment of ischemic heart disease with partially observable Markov decision processes
Diagnosis of a disease and its treatment are not separate, one-shot activities. Instead, they are very often dependent and interleaved over time. This is mostly due to uncertainty...
Milos Hauskrecht, Hamish S. F. Fraser