Sciweavers

1529 search results - page 246 / 306
» On Timing Analysis of Combinational Circuits
Sort
View
CADE
2002
Springer
14 years 8 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
ICRA
2009
IEEE
160views Robotics» more  ICRA 2009»
14 years 2 months ago
Tracking of facial features to support human-robot interaction
— In this paper we present a novel methodology for detection and tracking of facial features like eyes, nose and mouth in image sequences. The proposed methodology is intended to...
Maria Pateraki, Haris Baltzakis, Polychronis Konda...
GECCO
2009
Springer
101views Optimization» more  GECCO 2009»
14 years 2 months ago
Modeling UCS as a mixture of experts
We present a probabilistic formulation of UCS (a sUpervised Classifier System). UCS is shown to be a special case of mixture of experts where the experts are learned independentl...
Narayanan Unny Edakunni, Tim Kovacs, Gavin Brown, ...
BDIM
2008
IEEE
205views Business» more  BDIM 2008»
14 years 2 months ago
Mining semantic relations using NetFlow
—Knowing the dependencies among computing assets and services provides insights into the computing and business landscape, therefore, facilitating low-risk timely changes in supp...
Alexandru Caracas, Andreas Kind, Dieter Gantenbein...
GLOBECOM
2008
IEEE
14 years 2 months ago
Physical Layer Network Coding Schemes over Finite and Infinite Fields
: Direct application of network coding at the physical layer - physical layer network coding (PNC) - is a promising technique for two-way relay wireless networks. In a two-way rela...
Shengli Zhang, Soung Chang Liew, Lu Lu