Sciweavers

1361 search results - page 30 / 273
» Boolean Comparison by Simulation
Sort
View
COMPGEOM
1999
ACM
14 years 7 days ago
Interval Methods for Kinetic Simulations
We propose a speed-up method for discrete-event simulations, including sweep-line or -plane techniques, requiring the repeated calculation of the times at which certain discrete e...
Leonidas J. Guibas, Menelaos I. Karavelas
BMCBI
2008
130views more  BMCBI 2008»
13 years 8 months ago
An enhanced partial order curve comparison algorithm and its application to analyzing protein folding trajectories
Background: Understanding how proteins fold is essential to our quest in discovering how life works at the molecular level. Current computation power enables researchers to produc...
Hong Sun, Hakan Ferhatosmanoglu, Motonori Ota, Yus...
IDEAL
2000
Springer
13 years 11 months ago
Learning of Virtual Dealers in an Artificial Market: Comparison with Interview Data
Abstract. In this study we used a new agent-based approach, an artificial market approach, to analyze the ways that dealers process the information in financial news. We compared b...
Kiyoshi Izumi, Kazuhiro Ueda
ICASSP
2009
IEEE
13 years 11 months ago
Detection of sparse signals under finite-alphabet constraints
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
Zhi Tian, Geert Leus, Vincenzo Lottici
BCS
2008
13 years 9 months ago
A Hardware Relaxation Paradigm for Solving NP-Hard Problems
Digital circuits with feedback loops can solve some instances of NP-hard problems by relaxation: the circuit will either oscillate or settle down to a stable state that represents...
Paul Cockshott, Andreas Koltes, John O'Donnell, Pa...