Sciweavers

3172 search results - page 74 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
83
Voted
FSKD
2005
Springer
94views Fuzzy Logic» more  FSKD 2005»
15 years 6 months ago
Incremental Target Recognition Algorithm Based on Improved Discernibility Matrix
Abstract. An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. Some comparable experiments have been completed in o...
Yong Liu, Congfu Xu, Zhiyong Yan, Yunhe Pan
94
Voted
ANOR
2008
96views more  ANOR 2008»
15 years 27 days ago
How good are SPT schedules for fair optimality criteria
Abstract We consider the following scheduling setting: a set of
Eric Angel, Evripidis Bampis, Fanny Pascual
103
Voted
MFCS
2005
Springer
15 years 6 months ago
Strict Language Inequalities and Their Decision Problems
Systems of language equations of the form {ϕ(X1, . . . , Xn) = ∅, ψ(X1, . . . , Xn) = ∅} are studied, where ϕ, ψ may contain set-theoretic operations and concatenation; the...
Alexander Okhotin
84
Voted
ESOP
2003
Springer
15 years 6 months ago
Type Error Slicing in Implicitly Typed Higher-Order Languages
Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that ...
Christian Haack, J. B. Wells
108
Voted
JSYML
2010
95views more  JSYML 2010»
14 years 7 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey