Sciweavers

2479 search results - page 370 / 496
» A Computational Theory of Working Memory
Sort
View
TOPLAS
2008
81views more  TOPLAS 2008»
15 years 6 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
SIGECOM
2011
ACM
320views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
Market making and mean reversion
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
Tanmoy Chakraborty, Michael Kearns
ICCAD
2001
IEEE
201views Hardware» more  ICCAD 2001»
16 years 3 months ago
An Integrated Data Path Optimization for Low Power Based on Network Flow Method
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
Chun-Gi Lyuh, Taewhan Kim, Chien-Liang Liu
CLUSTER
2009
IEEE
15 years 10 months ago
24/7 Characterization of petascale I/O workloads
Abstract--Developing and tuning computational science applications to run on extreme scale systems are increasingly complicated processes. Challenges such as managing memory access...
Philip H. Carns, Robert Latham, Robert B. Ross, Ka...
PC
2010
196views Management» more  PC 2010»
15 years 4 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak