Sciweavers

450 search results - page 77 / 90
» Algorithmic uses of the Feferman-Vaught Theorem
Sort
View
FMICS
2010
Springer
13 years 9 months ago
SMT-Based Formal Verification of a TTEthernet Synchronization Function
Abstract. TTEthernet is a communication infrastructure for mixedcriticality systems that integrates dataflow from applications with different criticality levels on a single network...
Wilfried Steiner, Bruno Dutertre
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
13 years 9 months ago
Parsimony pressure made easy
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolutio...
Riccardo Poli, Nicholas Freitag McPhee
DCG
2008
82views more  DCG 2008»
13 years 8 months ago
Schnyder Woods and Orthogonal Surfaces
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
Stefan Felsner, Florian Zickfeld
NECO
2008
170views more  NECO 2008»
13 years 8 months ago
Representational Power of Restricted Boltzmann Machines and Deep Belief Networks
Deep Belief Networks (DBN) are generative neural network models with many layers of hidden explanatory factors, recently introduced by Hinton et al., along with a greedy layer-wis...
Nicolas Le Roux, Yoshua Bengio
EJC
2007
13 years 8 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi