Sciweavers

959 search results - page 94 / 192
» Possible and Necessary h-Indices
Sort
View
SARA
2009
Springer
14 years 4 months ago
Reformulating Planning Problems by Eliminating Unpromising Actions
Despite a big progress in solving planning problems, more complex problems still remain hard and challenging for existing planners. One of the most promising research directions i...
Lukás Chrpa, Roman Barták
SLE
2009
Springer
14 years 4 months ago
ScalaQL: Language-Integrated Database Queries for Scala
One of the most ubiquitous elements of modern computing is the relational database. Very few modern applications are created without some sort of database backend. Unfortunately, r...
Daniel Spiewak, Tian Zhao
UM
2009
Springer
14 years 4 months ago
Non-intrusive Personalisation of the Museum Experience
Abstract. The vast amount of information presented in museums is often overwhelming to a visitor, making it difficult to select personally interesting exhibits. Advances in mobile...
Fabian Bohnert, Ingrid Zukerman
LATIN
2010
Springer
14 years 4 months ago
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
Gero Greiner, Riko Jacob
CLUSTER
2008
IEEE
14 years 4 months ago
Empirical-based probabilistic upper bounds for urgent computing applications
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
Nick Trebon, Peter H. Beckman