Sciweavers

96 search results - page 17 / 20
» Designing a Coprocessor for Recurrent Computations
Sort
View
SAMOS
2004
Springer
14 years 25 days ago
with Wide Functional Units
— Architectural resources and program recurrences are the main limitations to the amount of Instruction-Level Parallelism (ILP) exploitable from loops, the most time-consuming pa...
Miquel Pericàs, Eduard Ayguadé, Javi...
EICS
2010
ACM
14 years 16 days ago
Using ensembles of decision trees to automate repetitive tasks in web applications
Web applications such as web-based email, spreadsheets and form filling applications have become ubiquitous. However, many of the tasks that users try to accomplish with such web ...
Zachary Bray, Per Ola Kristensson
SIROCCO
2008
13 years 9 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau
RTCSA
2008
IEEE
14 years 1 months ago
Real-Time Communications Over Cluster-Tree Sensor Networks with Mobile Sink Behaviour
· Modelling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand the behaviour of WSN under worst-case conditions and to...
Petr Jurcík, Ricardo Severino, Anis Koubaa,...
CEC
2007
IEEE
14 years 1 months ago
Evolvability and Redundancy in Shared Grammar Evolution
— Shared grammar evolution (SGE) is a novel scheme for representing and evolving a population of variablelength programs as a shared set of grammatical productions. Productions t...
Martin H. Luerssen, David M. W. Powers