Sciweavers

607 search results - page 41 / 122
» Unifying Exact Completions
Sort
View
WSC
1998
15 years 9 days ago
GMSim: A Tool for Compositional GSMP Modeling
The development of a discrete-event simulation tool, called GMSim, based on the generalized semi-Markov process (GSMP) formalism is described. The GSMP representation comprises bo...
Frode B. Nilson
GG
2008
Springer
15 years 1 days ago
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [AAD+ 04] and models introduced and studied by ...
Jérémie Chalopin, Antoni W. Mazurkie...
JC
2008
92views more  JC 2008»
14 years 11 months ago
Characterizing Valiant's algebraic complexity classes
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
Guillaume Malod, Natacha Portier
IJIS
2000
75views more  IJIS 2000»
14 years 10 months ago
Relating decision under uncertainty and multicriteria decision making models
This short overview paper points out the striking similarity between decision under uncertainty and multicriteria decision making problems, two areas which have been developed in ...
Didier Dubois, Michel Grabisch, François Mo...
JMLR
2002
78views more  JMLR 2002»
14 years 10 months ago
Shallow Parsing using Specialized HMMs
We present a unified technique to solve different shallow parsing tasks as a tagging problem using a Hidden Markov Model-based approach (HMM). This technique consists of the incor...
Antonio Molina, Ferran Pla