Sciweavers

4488 search results - page 850 / 898
» Properties of NP-Complete Sets
Sort
View
CLUSTER
2009
IEEE
13 years 12 months ago
24/7 Characterization of petascale I/O workloads
Abstract--Developing and tuning computational science applications to run on extreme scale systems are increasingly complicated processes. Challenges such as managing memory access...
Philip H. Carns, Robert Latham, Robert B. Ross, Ka...
ICCS
2007
Springer
13 years 11 months ago
Building Verifiable Sensing Applications Through Temporal Logic Specification
Abstract. Sensing is at the core of virtually every DDDAS application. Sensing applications typically involve distributed communication and coordination over large self-organized n...
Asad Awan, Ahmed H. Sameh, Suresh Jagannathan, Ana...
BALT
2006
13 years 11 months ago
Introducing Softness into Inductive Queries on String Databases
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
Ieva Mitasiunaite, Jean-François Boulicaut
CC
2006
Springer
125views System Software» more  CC 2006»
13 years 11 months ago
Path-Based Reuse Distance Analysis
Abstract. Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse dista...
Changpeng Fang, Steve Carr, Soner Önder, Zhen...
CCS
2006
ACM
13 years 11 months ago
Beyond separation of duty: an algebra for specifying high-level security policies
A high-level security policy states an overall requirement for a sensitive task. One example of a high-level security policy is a separation of duty policy, which requires a sensi...
Ninghui Li, Qihua Wang