Sciweavers

4117 search results - page 640 / 824
» On the Satisfiability of Complex Constraints
Sort
View
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
16 years 1 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
TRUSTBUS
2009
Springer
16 years 1 months ago
The OPL Access Control Policy Language
Abstract. Existing policy languages suffer from a limited ability of directly and elegantly expressing high-level access control principles such as history-based separation of dut...
Christopher Alm, Ruben Wolf, Joachim Posegga
ATAL
2009
Springer
16 years 1 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
COMPSAC
2008
IEEE
16 years 1 months ago
Service-Oriented Modelling of Automotive Systems
We discuss the suitability of service-oriented computing for the automotive domain. We present a formal high-level language in which complex automotive activities can be modelled ...
Laura Bocchi, José Luiz Fiadeiro, Ant&oacut...
186
Voted
DCC
2008
IEEE
16 years 1 months ago
Shared Descriptions Fusion Coding for Storage and Selective Retrieval of Correlated Sources
Motivated by sensor networks, we consider the fusion storage of correlated sources in a database, such that any subset of them may be efficiently retrieved in the future. Only st...
Sharadh Ramaswamy, Kenneth Rose