Sciweavers

3818 search results - page 486 / 764
» Learning from Order Examples
Sort
View
CORR
2008
Springer
75views Education» more  CORR 2008»
15 years 4 months ago
A new probabilistic transformation of belief mass assignment
In this paper, we propose in Dezert-Smarandache Theory (DSmT) framework, a new probabilistic transformation, called DSmP, in order to build a subjective probability measure from an...
Jean Dezert, Florentin Smarandache
AMC
2006
145views more  AMC 2006»
15 years 4 months ago
Computing the moments of high dimensional solutions of the master equation
Derived from the Markov character only, the master equation of chemical reactions is an accurate stochastic description of quite general systems in chemistry. Exact solutions of t...
Stefan Engblom
ENTCS
2006
112views more  ENTCS 2006»
15 years 4 months ago
Interface Automata with Complex Actions
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...
Shahram Esmaeilsabzali, Farhad Mavaddat, Nancy A. ...
JCSS
2008
96views more  JCSS 2008»
15 years 4 months ago
A combinatorial characterization of resolution width
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
Albert Atserias, Víctor Dalmau
135
Voted
EOR
2007
79views more  EOR 2007»
15 years 4 months ago
Consensus reaching in committees
In this paper, we apply a consensus model to decision-making in committees that have to choose one or more alternatives from a set of alternatives. The model does not use a voting...
Patrik Eklund, Agnieszka Rusinowska, Harrie C. M. ...