7988 search results - page 321 / 1598 » A Useful Undecidable Theory |
175
click to vote
SUM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. An ontology matching method (or a matcher) aims at matching every entity (or concept) in one ontology to the most suitable entity (or entities) in another ontology. Usual...
159
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
The paper presents an extension of Vose’s Markov chain model for genetic algorithm (GA). The model contains not only standard genetic operators such as mutation and crossover bu...
153
click to vote
ASIAN
2006
Springer
15 years 9 months ago
2006
Springer
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
164
click to vote
WER
2010
Springer
15 years 3 months ago
2010
Springer
Real-time scheduling theory has made a great progress in the last decades. From small devices to enormous satellites or industrial plants take advantage of this ongoing research. H...
138
Voted
HICSS
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper presents results from a study of mobile ticketing service acceptance in public transportation. The theoretical background of the study was drawn from technology accepta...