Sciweavers

17983 search results - page 194 / 3597
» Set Types and Applications
Sort
View
JSYML
2007
95views more  JSYML 2007»
15 years 6 months ago
Applications of Kolmogorov complexity to computable model theory
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique com...
Bakhadyr Khoussainov, Pavel Semukhin, Frank Stepha...
IPL
2011
63views more  IPL 2011»
15 years 1 months ago
Edge-colored graphs with applications to homogeneous faults
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
Yongge Wang, Yvo Desmedt
LPNMR
2009
Springer
15 years 11 months ago
PHYLO-ASP: Phylogenetic Systematics with Answer Set Programming
This note summarizes the use of Answer Set Programming to solve various computational problems to infer phylogenetic trees and phylogenetic networks, and discusses its applicabilit...
Esra Erdem
AUSDM
2006
Springer
177views Data Mining» more  AUSDM 2006»
15 years 10 months ago
On The Optimal Working Set Size in Serial and Parallel Support Vector Machine Learning With The Decomposition Algorithm
The support vector machine (SVM) is a wellestablished and accurate supervised learning method for the classification of data in various application fields. The statistical learnin...
Tatjana Eitrich, Bruno Lang
DATE
2002
IEEE
137views Hardware» more  DATE 2002»
15 years 11 months ago
Practical Instruction Set Design and Compiler Retargetability Using Static Resource Models
The design of application (-domain) specific instructionset processors (ASIPs), optimized for code size, has traditionally been accompanied by the necessity to program assembly, ...
Qin Zhao, Bart Mesman, Twan Basten