Sciweavers

1207 search results - page 148 / 242
» Towards optimal k-anonymization
Sort
View
ASP
2003
Springer
14 years 2 months ago
Implementing OCLP as a front-end for Answer Set Solvers: From Theory to Practice
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
Martin Brain, Marina De Vos
EUROGP
2003
Springer
173views Optimization» more  EUROGP 2003»
14 years 2 months ago
Tree Adjoining Grammars, Language Bias, and Genetic Programming
In this paper, we introduce a new grammar guided genetic programming system called tree-adjoining grammar guided genetic programming (TAG3P+), where tree-adjoining grammars (TAGs) ...
Nguyen Xuan Hoai, Robert I. McKay, Hussein A. Abba...
ICOIN
2003
Springer
14 years 2 months ago
Information-Theoretic Bounds for Mobile Ad-hoc Networks Routing Protocols
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
Nianjun Zhou, Alhussein A. Abouzeid
IPPS
2002
IEEE
14 years 2 months ago
Distribution Sweeping on Clustered Machines with Hierarchical Memories
This paper investigates the design of parallel algorithmic strategies that address the efficient use of both, memory hierarchies within each processor and a multilevel clustered ...
Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pie...
CDC
2009
IEEE
153views Control Systems» more  CDC 2009»
14 years 2 months ago
Compositional stability analysis based on dual decomposition
— We propose a compositional stability analysis methodology for verifying properties of systems that are interconnections of multiple subsystems. The proposed method assembles st...
Ufuk Topcu, Andrew K. Packard, Richard M. Murray