Sciweavers

318 search results - page 9 / 64
» Real Number Computability and Domain Theory
Sort
View
CIE
2007
Springer
14 years 2 months ago
A Useful Undecidable Theory
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
Victor L. Selivanov
ECSQARU
2007
Springer
14 years 2 months ago
Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, ...
Norbert Lehmann
EJC
2000
13 years 8 months ago
Further Investigations Involving Rook Polynomials With Only Real Zeros
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...
James Haglund
GECCO
2005
Springer
137views Optimization» more  GECCO 2005»
14 years 2 months ago
Constant generation for the financial domain using grammatical evolution
This study reports the work to date on the analysis of different methodologies for constant creation with the aim of applying the most advantageous method to the dynamic real wor...
Ian Dempsey
ICPR
2002
IEEE
14 years 9 months ago
A Ball Detection Algorithm for Real Soccer Image Sequences
A large number of methods for circle detection has been studied in the last years for numerous image processing applications. The application domain considered in this paper is th...
Tiziana D'Orazio, Nicola Ancona, Grazia Cicirelli,...