Sciweavers

217 search results - page 12 / 44
» Backdoors To Typical Case Complexity
Sort
View
ADC
1995
Springer
90views Database» more  ADC 1995»
15 years 2 months ago
Computer Supported Query Formulation in an Evolving Context
Even if high-level query languages are used, query formulation may cause problems. This is notably so in case of large and complex application domains. Typical examples of these k...
Arthur H. M. ter Hofstede, Henderik Alex Proper, T...
93
Voted
DT
2000
88views more  DT 2000»
14 years 11 months ago
Postsilicon Validation Methodology for Microprocessors
f abstraction as applicable to break the problem's complexity, and innovating better techniques to address complexity of new microarchitectural features. Validation techniques...
Hemant G. Rotithor
JMLR
2011
125views more  JMLR 2011»
14 years 6 months ago
Approximate Marginals in Latent Gaussian Models
We consider the problem of improving the Gaussian approximate posterior marginals computed by expectation propagation and the Laplace method in latent Gaussian models and propose ...
Botond Cseke, Tom Heskes
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
14 years 6 months ago
Asymmetric information diffusion via gossiping on static and dynamic networks
In this paper we consider the problem of gossiping in a network to diffuse the average of a sub-set of nodes, called sources, and directing it to another sub-set of nodes in the ne...
Mehmet Ercan Yildiz, Anna Scaglione, Asuman E. Ozd...
SAFECOMP
2009
Springer
15 years 5 months ago
Establishing a Framework for Dynamic Risk Management in 'Intelligent' Aero-Engine Control
The behaviour of control functions in safety critical software systems is typically bounded to prevent the occurrence of known system level hazards. These bounds are typically deri...
Zeshan Kurd, Tim Kelly, John A. McDermid, Radu Cal...