Sciweavers

6829 search results - page 1156 / 1366
» Quantitative Generalizations of Languages
Sort
View
JIPS
2006
116views more  JIPS 2006»
15 years 4 months ago
A Method for Automatic Generation of OWL-S Service Ontology
: We present in this paper the methodology for automatic generation of OWL-S service model ontology along with the results and issues. First, we extract information related to atom...
Jin-Hyuk Yang, In-Jeong Chung
KES
2008
Springer
15 years 4 months ago
Functional genetic programming and exhaustive program search with combinator expressions
Using a strongly typed functional programming language for genetic programming has many advantages, but evolving functional programs with variables requires complex genetic operat...
Forrest Briggs, Melissa O'Neill
JMM2
2006
126views more  JMM2 2006»
15 years 4 months ago
Modeling Augmented Reality User Interfaces with SSIML/AR
Augmented Reality (AR) technologies open up new possibilities especially for task-focused domains such as assembly and maintenance. However, it can be noticed that there is still a...
Arnd Vitzthum, Heinrich Hussmann
ENTCS
2007
121views more  ENTCS 2007»
15 years 4 months ago
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract)
ly positive maps (extended abstract) Peter Selinger 1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories ...
Peter Selinger
LISP
2006
105views more  LISP 2006»
15 years 4 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
« Prev « First page 1156 / 1366 Last » Next »