Sciweavers

187 search results - page 6 / 38
» Structural Results For Planar Sets With Many Similar Subsets
Sort
View
ENASE
2011
219views Hardware» more  ENASE 2011»
12 years 9 months ago
Mutation Selection: Some Could be Better than All
In previous research, many mutation selection techniques have been proposed to reduce the cost of mutation analysis. After a mutant subset is selected, researchers could obtain a t...
Zhiyi Zhang, Dongjiang You, Zhenyu Chen, Yuming Zh...
ICML
2002
IEEE
14 years 11 months ago
Action Refinement in Reinforcement Learning by Probability Smoothing
In many reinforcement learning applications, the set of possible actions can be partitioned by the programmer into subsets of similar actions. This paper presents a technique for ...
Carles Sierra, Dídac Busquets, Ramon L&oacu...
DM
2011
223views Education» more  DM 2011»
13 years 5 months ago
On graph equivalences preserved under extensions
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
Zbigniew Lonc, Miroslaw Truszczynski
ICCBR
2009
Springer
13 years 7 months ago
On Similarity Measures Based on a Refinement Lattice
Abstract. Retrieval of structured cases using similarity has been studied in CBR but there has been less activity on defining similarity on description logics (DL). In this paper w...
Santiago Ontañón, Enric Plaza
WABI
2007
Springer
14 years 4 months ago
Topology Independent Protein Structural Alignment
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta,...