Sciweavers

1404 search results - page 134 / 281
» Complexity of admissible rules
Sort
View
131
Voted
AAAI
2007
15 years 6 months ago
On the Partial Observability of Temporal Uncertainty
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
Michael D. Moffitt
148
Voted
GECCO
2008
Springer
158views Optimization» more  GECCO 2008»
15 years 4 months ago
Structure and parameter estimation for cell systems biology models
In this work we present a new methodology for structure and parameter estimation in cell systems biology modelling. Our modelling framework is based on P systems, an unconl comput...
Francisco José Romero-Campero, Hongqing Cao...
133
Voted
DSS
2008
130views more  DSS 2008»
15 years 3 months ago
Knowledge representation concepts for automated SLA management
Outsourcing of complex IT infrastructure to IT service providers has increased substantially during the past years. IT service providers must be able to fulfil their service-qualit...
Adrian Paschke, Martin Bichler
118
Voted
PAMI
2006
95views more  PAMI 2006»
15 years 3 months ago
Table Detection in Online Ink Notes
In documents, tables are important structured objects that present statistical and relational information. In this paper, we present a robust system which is capable of detecting t...
Zhouchen Lin, Junfeng He, Zhicheng Zhong, Rongrong...
106
Voted
JMLR
2002
144views more  JMLR 2002»
15 years 3 months ago
Round Robin Classification
In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifie...
Johannes Fürnkranz