Sciweavers

1088 search results - page 138 / 218
» Independence of Negative Constraints
Sort
View
EMNLP
2006
14 years 11 months ago
Better Informed Training of Latent Syntactic Features
We study unsupervised methods for learning refinements of the nonterminals in a treebank. Following Matsuzaki et al. (2005) and Prescher (2005), we may for example split NP withou...
Markus Dreyer, Jason Eisner
87
Voted
AAAI
1998
14 years 11 months ago
Solving Very Large Weakly Coupled Markov Decision Processes
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, L...
ATAL
2008
Springer
14 years 11 months ago
Anchoring institutions in agents' attitudes: towards a logical framework for autonomous multi-agent systems
The aim of this paper is to provide a logical framework for the specification of autonomous Multi-Agent Systems (MAS). A MAS is autonomous in so far as it is capable of binding (...
Benoit Gaudou, Dominique Longin, Emiliano Lorini, ...
DBSEC
2009
112views Database» more  DBSEC 2009»
14 years 11 months ago
Distributed Anonymization: Achieving Privacy for Both Data Subjects and Data Providers
There is an increasing need for sharing data repositories containing personal information across multiple distributed and private databases. However, such data sharing is subject t...
Pawel Jurczyk, Li Xiong
FLAIRS
2008
14 years 11 months ago
On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization
Unit propagation-based (UP) lower bounds are used in the vast majority of current Max-SAT solvers. However, lower bounds based on UP have seldom been applied in PseudoBoolean Opti...
Federico Heras, Vasco M. Manquinho, João Ma...