Sciweavers

343 search results - page 45 / 69
» On Making Directed Graphs Transitive
Sort
View
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
15 years 8 months ago
Exploiting structure in an AIG based QBF solver
—In this paper we present a procedure for solving quantified boolean formulas (QBF), which uses And-Inverter Graphs (AIGs) as the core data-structure. We make extensive use of s...
Florian Pigorsch, Christoph Scholl
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 1 months ago
A field-theory motivated approach to symbolic computer algebra
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
Kasper Peeters
ISI
2007
Springer
15 years 1 months ago
Outil autonome de surveillance de grilles
ABSTRACT. Grids have become very complex. It makes the deployment and maintenance of systems a difficult task requiring lots of efforts from administrators. We believe that peer-t...
Laurent Baduel, Satoshi Matsuoka
TNN
1998
123views more  TNN 1998»
15 years 1 months ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
CCS
2009
ACM
16 years 2 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao