Sciweavers

2061 search results - page 80 / 413
» The continuous knapsack set
Sort
View
CSR
2009
Springer
15 years 1 months ago
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
Olaf Beyersdorff, Zenon Sadowski
IJCAI
2003
14 years 11 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
SPLC
2008
14 years 11 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
MDM
2005
Springer
174views Communications» more  MDM 2005»
15 years 3 months ago
GPAC: generic and progressive processing of mobile queries over mobile data
This paper introduces a new family of Generic and Progressive algorithms (GPAC, for short) for continuous mobile queries over mobile objects. GPAC provides a general skeleton that...
Mohamed F. Mokbel, Walid G. Aref
SDM
2009
SIAM
217views Data Mining» more  SDM 2009»
15 years 7 months ago
A Framework for Exploring Categorical Data.
In this paper, we present a framework for categorical data analysis which allows such data sets to be explored using a rich set of techniques that are only applicable to continuou...
Shyam Boriah, Varun Chandola, Vipin Kumar