Sciweavers

567 search results - page 26 / 114
» Decomposing replicable functions
Sort
View
MICRO
1998
IEEE
79views Hardware» more  MICRO 1998»
15 years 1 months ago
Widening Resources: A Cost-effective Technique for Aggressive ILP Architectures
The inherent instruction-level parallelism (ILP) of current applications (specially those based on floating point computations) has driven hardware designers and compilers writers...
David López, Josep Llosa, Mateo Valero, Edu...
CORR
2010
Springer
91views Education» more  CORR 2010»
14 years 9 months ago
Simulations of Weighted Tree Automata
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...
Zoltán Ésik, Andreas Maletti
CORR
2006
Springer
92views Education» more  CORR 2006»
14 years 9 months ago
Personal Information Ecosystems and Implications for Design
Today, people use multiple devices to fulfill their information needs. However, designers design each device individually, without accounting for the other devices that users may ...
Manas Tungare, Pardha S. Pyla, Manuel A. Pé...
GECCO
2000
Springer
108views Optimization» more  GECCO 2000»
15 years 1 months ago
Hierarchical Problem Solving and the Bayesian Optimization Algorithm
The paper discusses three major issues. First, it discusses why it makes sense to approach problems in a hierarchical fashion. It de nes the class of hierarchically decomposable f...
Martin Pelikan, David E. Goldberg
ORL
2006
84views more  ORL 2006»
14 years 9 months ago
An M/M/1 retrial queue with unreliable server
We analyze an unreliable M/M/1 retrial queue with infinite-capacity orbit and normal queue. Retrial customers do not rejoin the normal queue but repeatedly attempt to access the s...
Nathan P. Sherman, Jeffrey P. Kharoufeh