Sciweavers

1662 search results - page 175 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ISSAC
2004
Springer
102views Mathematics» more  ISSAC 2004»
15 years 9 months ago
FFPACK: finite field linear algebra package
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
Jean-Guillaume Dumas, Pascal Giorgi, Clémen...
TSP
2010
14 years 10 months ago
Selection policy-induced reduction mappings for Boolean networks
Developing computational models paves the way to understanding, predicting, and influencing the long-term behavior of genomic regulatory systems. However, several major challenges ...
Ivan Ivanov, Plamen Simeonov, Noushin Ghaffari, Xi...
AVI
2008
15 years 6 months ago
End-user visualizations
Computer visualization has advanced dramatically over the last few years, partially driven by the exploding video game market. 3D hardware acceleration has reached the point where...
Alexander Repenning, Andri Ioannidou
COMSWARE
2007
IEEE
15 years 10 months ago
Situation-Aware Software Engineering for Sensor Networks
—Sensor networks represent a new frontier in technology that holds the promise of unprecedented levels of autonomy in the execution of complex dynamic missions by harnessing the ...
Vir V. Phoha, Shashi Phoha
DAC
1994
ACM
15 years 8 months ago
A Modular Partitioning Approach for Asynchronous Circuit Synthesis
Asynchronous circuits are crucial in designing low power and high performance digital systems. In this paper, we present an ecient modular partitioning approach for asynchronous c...
Ruchir Puri, Jun Gu