Sciweavers

213 search results - page 11 / 43
» The Formal Structure of Ecological Contexts
Sort
View
UAI
2004
13 years 9 months ago
Case-Factor Diagrams for Structured Probabilistic Modeling
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
David A. McAllester, Michael Collins, Fernando Per...
NIPS
2000
13 years 9 months ago
The Use of Classifiers in Sequential Inference
We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we deve...
Vasin Punyakanok, Dan Roth
AISB
1994
Springer
13 years 11 months ago
Formal Memetic Algorithms
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
Nicholas J. Radcliffe, Patrick D. Surry
JODS
2007
138views Data Mining» more  JODS 2007»
13 years 7 months ago
A Formal Framework for Adaptive Access Control Models
Abstract. For several reasons enterprises are frequently subject to organizational change. Respective adaptations may concern business processes, but also other components of an en...
Stefanie Rinderle, Manfred Reichert
CPP
2011
107views more  CPP 2011»
12 years 7 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge