Sciweavers

7197 search results - page 250 / 1440
» On the computational power of BlenX
Sort
View
222
Voted
PPAM
2007
Springer
16 years 1 months ago
A Grid-Enabled Lattice-Boltzmann-Based Modelling System
Lattice-Boltzmann (LB) methods are a well-known technique in the context of computational fluid dynamics. By nature, they can easily be parallelized but their adaptation to the Gr...
Gérard Dethier, Cyril Briquet, Pierre March...
247
Voted
LICS
2012
IEEE
13 years 9 months ago
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
Serge Haddad, Sylvain Schmitz, Philippe Schnoebele...
STACS
2010
Springer
16 years 2 months ago
Large-Girth Roots of Graphs
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
Anna Adamaszek, Michal Adamaszek
200
Voted
ICPP
2009
IEEE
16 years 2 months ago
Analysis of Parallel Algorithms for Energy Conservation in Scalable Multicore Architectures
Abstract—This paper analyzes energy characteristics of parallel algorithms executed on scalable multicore processors. Specifically, we provide a methodology for evaluating energ...
Vijay Anand Korthikanti, Gul Agha
COMCOM
2004
118views more  COMCOM 2004»
15 years 7 months ago
The next frontier for communications networks: power management
Storage, memory, processor, and communications bandwidth are all relatively plentiful and inexpensive. However, a growing expense in the operation of computer networks is electric...
Kenneth J. Christensen, Chamara Gunaratne, Bruce N...