1838 search results - page 187 / 368 » Process modelling: the deontic way |
263
click to vote
ADHOC
2010
15 years 3 months ago
2010
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
216
click to vote
EMNLP
2011
14 years 6 months ago
2011
We propose a general method to watermark and probabilistically identify the structured outputs of machine learning algorithms. Our method is robust to local editing operations and...
166
click to vote
PERCOM
2007
ACM
16 years 6 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
187
click to vote
NIPS
2004
15 years 7 months ago
2004
Multiple realizations of continuous-valued time series from a stochastic process often contain systematic variations in rate and amplitude. To leverage the information contained i...
177
click to vote
CICLING
2010
Springer
16 years 1 months ago
2010
Springer
This paper deals with theoretical problems found in the work that is being carried out for annotating semantic roles in the Basque Dependency Treebank (BDT). We will present the re...