Sciweavers

3954 search results - page 71 / 791
» Image-based Model Completion
Sort
View
98
Voted
ESANN
2008
15 years 4 months ago
Using graph-theoretic measures to predict the performance of associative memory models
We test a selection of associative memory models built with different connection strategies, exploring the relationship between the structural properties of each network and its pa...
Lee Calcraft, Rod Adams, Weiliang Chen, Neil Davey
106
Voted
APAL
2010
129views more  APAL 2010»
15 years 2 months ago
Kripke models for classical logic
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
Danko Ilik, Gyesik Lee, Hugo Herbelin
105
Voted
CADE
2006
Springer
16 years 2 months ago
Geometric Resolution: A Proof Procedure Based on Finite Model Search
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...
Hans de Nivelle, Jia Meng
112
Voted
UC
2005
Springer
15 years 8 months ago
A Computational Model for Self-assembling Flexible Tiles
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
Natasa Jonoska, Gregory L. McColm
96
Voted
DAC
1999
ACM
15 years 7 months ago
IC Analyses Including Extracted Inductance Models
IC inductance extraction generally produces either port inductances based on simplified current path assumptions or a complete partial inductance matrix. Combining either of thes...
Michael W. Beattie, Lawrence T. Pileggi