Sciweavers

666 search results - page 114 / 134
» The Pipelined Set Cover Problem
Sort
View
IWPEC
2009
Springer
16 years 5 days ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
JUCS
2007
95views more  JUCS 2007»
15 years 5 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow
SIGMOD
1996
ACM
133views Database» more  SIGMOD 1996»
15 years 9 months ago
Multi-dimensional Resource Scheduling for Parallel Queries
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
Minos N. Garofalakis, Yannis E. Ioannidis
ECRTS
2010
IEEE
15 years 6 months ago
Making DRAM Refresh Predictable
Embedded control systems with hard real-time constraints require that deadlines are met at all times or the system may malfunction with potentially catastrophic consequences. Sched...
Balasubramanya Bhat, Frank Mueller
ASWC
2009
Springer
15 years 3 months ago
SHARE: A Semantic Web Query Engine for Bioinformatics
Driven by the goal of automating data analyses in the field of bioinformatics, SHARE (Semantic Health and Research Environment) is a specialized SPARQL engine that resolves queries...
Benjamin P. Vandervalk, E. Luke McCarthy, Mark D. ...