Sciweavers

1763 search results - page 101 / 353
» Dependent random choice
Sort
View
CEC
2009
IEEE
13 years 7 months ago
Analysis of constant creation techniques on the binomial-3 problem with grammatical evolution
This paper studies the difference between Persistent Random Constants (PRC) and Digit Concatenation as methods for generating constants. It has been shown that certain problems hav...
Jonathan Byrne, Michael O'Neill, Erik Hemberg, Ant...
ICDAR
2009
IEEE
13 years 7 months ago
Document Image Binarisation Using Markov Field Model
This paper presents a new approach for the binarization of seriously degraded manuscript. We introduce a new technique based on a Markov Random Field (MRF) model of the document. ...
Thibault Lelore, Frédéric Bouchara
CONCUR
2003
Springer
14 years 2 months ago
Priority Rewrite Systems for OSOS Process Languages
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
Irek Ulidowski
HASE
1997
IEEE
14 years 1 months ago
Analytical Modelling and Evaluation of Phased-Mission Systems for Space Applications
This paper deals with the modelling and evaluation of mission-phased systems devoted to space applications. We propose a two level hierarchical method that allows to model such sy...
Andrea Bondavalli, Ivan Mura, Manuela Nelli
IJCAI
1989
13 years 10 months ago
Control of Refitting during Plan Reuse
In plan reuse, refitting is the process of modifying an existing plan to make it applicable to a new problem situation. An efficient refitting strategy needs to be conservative, i...
Subbarao Kambhampati, James A. Hendler