Sciweavers

1404 search results - page 162 / 281
» Complexity of admissible rules
Sort
View
FGCS
2007
125views more  FGCS 2007»
13 years 8 months ago
An autonomic tool for building self-organizing Grid-enabled applications
In this paper we present CAMELotGrid, a tool to manage Grid computations of Cellular Automata that support the efficient simulation of complex systems modeled by a very large numb...
Gianluigi Folino, Giandomenico Spezzano
INFOCOM
2012
IEEE
11 years 11 months ago
Maximizing system throughput by cooperative sensing in Cognitive Radio Networks
—Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the ...
Shuang Li, Zizhan Zheng, Eylem Ekici, Ness B. Shro...
IEEEARES
2010
IEEE
14 years 3 months ago
Strategies for Reducing Risks of Inconsistencies in Access Control Policies
—Managing access control policies is a complex task. We argue that much of the complexity is unnecessary and mostly due to historical reasons. There are number of legacy policy s...
Bernard Stepien, Stan Matwin, Amy P. Felty
PLDI
2009
ACM
14 years 3 months ago
Proving optimizations correct using parameterized program equivalence
Translation validation is a technique for checking that, after an optimization has run, the input and output of the optimization are equivalent. Traditionally, translation validat...
Sudipta Kundu, Zachary Tatlock, Sorin Lerner
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
14 years 1 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...