Search Results - "Guidetti, Marco"

Thermodynamic glass transition in a spin glass without time-reversal symmetry by Baños, Raquel Alvarez, Cruz, Andres, Fernandez, Luis Antonio, Gil-Narvion, Jose Miguel, Gordillo-Guerrero, Antonio, Guidetti, Marco, Iñiguez, David, Maiorano, Andrea, Marinari, Enzo, Martin-Mayor, Victor, Monforte-Garcia, Jorge, Muñoz Sudupe, Antonio, Navarro, Denis, Parisi, Giorgio, Perez-Gaviro, Sergio, Ruiz-Lorenzo, Juan Jesus, Schifano, Sebastiano Fabio, Seoane, Beatriz, Tarancon, Alfonso, Tellez, Pedro, Tripiccione, Raffaele, Yllanes, David

“…Spin glasses are a longstanding model for the sluggish dynamics that appear at the glass transition. However, spin glasses differ from structural glasses in a…”
Get full text

Modelling and experimental validation of external spur gear machines for fluid power applications by Vacca, Andrea, Guidetti, Marco

“…The modelling of positive displacement machines has to deal with the complexity of solving the flow through the unit in presence of simultaneous macro and…”
Get full text

Janus: An FPGA-Based System for High-Performance Scientific Computing by Belletti, Francesco, Cotallo, Maria, Cruz, A, Fernandez, Luis Antonio, Gordillo-Guerrero, Antonio, Guidetti, Marco, Maiorano, Andrea, Mantovani, Filippo, Marinari, Enzo, Martin-Mayor, Victor, Munoz-Sudupe, Antonio, Navarro, Denis, Parisi, Giorgio, Perez-Gaviro, Sergio, Rossi, Mauro, Ruiz-Lorenzo, Juan J, Schifano, Sebastiano Fabio, Sciretti, Daniele, Tarancon, Alfonso, Tripiccione, Raffaele, Velasco, J Luis, Yllanes, David, Zanier, Gianpaolo

“…Janus is a modular, massively parallel, and reconfigurable FPGA-based computing system. Each Janus module has one computational core and one host. Janus is…”
Get full text

Complexity of several constraint-satisfaction problems using the heuristic classical algorithm WalkSAT by Guidetti, Marco, Young, A P

“…We determine the complexity of several constraint-satisfaction problems using the heuristic algorithm WalkSAT. At large sizes N, the complexity increases…”
Get full text

Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT by Guidetti, Marco, Young, A. P

“…We determine the complexity of several constraint satisfaction problems using the heuristic algorithm, WalkSAT. At large sizes N, the complexity increases…”
Get full text