Sciweavers

488 search results - page 86 / 98
» The descriptive complexity approach to LOGCFL
Sort
View
RTAS
1997
IEEE
14 years 2 months ago
Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches
ÐWith effective packet-scheduling mechanisms, modern integrated networks can support the diverse quality-of-service requirements of emerging applications. However, arbitrating bet...
Sung-Whan Moon, Kang G. Shin, Jennifer Rexford
AIL
2007
126views more  AIL 2007»
13 years 10 months ago
A web ontologies framework for digital rights management
In order to improve the management of copyright in the Internet, known as Digital Rights Management, there is the need for a shared language for copyright representation. Current a...
Roberto García, Rosa Gil, Jaime Delgado
BMCBI
2010
189views more  BMCBI 2010»
13 years 8 months ago
solQTL: a tool for QTL analysis, visualization and linking to genomes at SGN database
Background: A common approach to understanding the genetic basis of complex traits is through identification of associated quantitative trait loci (QTL). Fine mapping QTLs require...
Isaak Y. Tecle, Naama Menda, Robert M. Buels, Esth...
ICALP
2009
Springer
14 years 10 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
ICFEM
2009
Springer
14 years 4 months ago
Role-Based Symmetry Reduction of Fault-Tolerant Distributed Protocols with Language Support
Fault-tolerant (FT) distributed protocols (such as group membership, consensus, etc.) represent fundamental building blocks for many practical systems, e.g., the Google File System...
Péter Bokor, Marco Serafini, Neeraj Suri, H...