Sciweavers

489 search results - page 87 / 98
» On the Execution of ODP Computational Specifications
Sort
View
ICALP
2009
Springer
14 years 9 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 9 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
POPL
2010
ACM
14 years 6 months ago
Monads in Action
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
Andrzej Filinski
AINA
2009
IEEE
14 years 3 months ago
Toward fMRI Group Identification Based on Brain Lateralization
— This research presents a novel application of Lateralization Index (LI) in support of a decision making process for the classification of subjects based on their brain activati...
Magno R. Guillen, Malek Adjouadi, Xiaozhen You, Ar...
ATAL
2009
Springer
14 years 3 months ago
From DPS to MAS to ...: continuing the trends
The most important and interesting of the computing challenges we are facing are those that involve the problems and opportunities afforded by massive decentralization and disinte...
Michael N. Huhns