Sciweavers

8699 search results - page 240 / 1740
» Elements of the Theory of Computation
Sort
View
FSTTCS
2004
Springer
16 years 15 hour ago
Join Algorithms for the Theory of Uninterpreted Functions
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
Sumit Gulwani, Ashish Tiwari, George C. Necula
171
Voted
PADL
2004
Springer
15 years 12 months ago
An Algebraic Theory of Polymorphic Temporal Media
Temporal media is information that is directly consumed by a user, and that varies with time. Examples include music, digital sound files, computer animations, and video clips. I...
Paul Hudak
AIME
2003
Springer
15 years 12 months ago
Ontology for Task-Based Clinical Guidelines and the Theory of Granular Partitions
The theory of granular partitions (TGP) is a new approach to the understanding of ontologies and other classificatory systems. The paper explores the use of this new theory in the ...
Anand Kumar, Barry Smith
KR
1994
Springer
15 years 10 months ago
Modalities Over Actions, I. Model Theory
This paper analyzes a language for actions and the deontic modalities over actions -- i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action...
L. Thorne McCarty
GECCO
2006
Springer
189views Optimization» more  GECCO 2006»
15 years 10 months ago
Game theory as a new paradigm for phenotype characterization of genetic algorithms
In this paper, it is presented a new way to characterize the phenotype in the context of Genetic Algorithms through the use of Game Theory as a theoretical foundation to define a ...
Otávio Noura Teixeira, Artur Noura Teixeira...