Sciweavers

217 search results - page 13 / 44
» Backdoors To Typical Case Complexity
Sort
View
136
Voted
ICLP
2005
Springer
15 years 9 months ago
OWL: A Description Logic Based Ontology Language
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
Ian Horrocks
126
Voted
ICST
2009
IEEE
15 years 10 months ago
Quality Assurance of Software Applications Using the In Vivo Testing Approach
Software products released into the field typically have some number of residual defects that either were not detected or could not have been detected during testing. This may be...
Christian Murphy, Gail E. Kaiser, Ian Vo, Matt Chu
125
Voted
GECCO
2007
Springer
234views Optimization» more  GECCO 2007»
15 years 10 months ago
Applying particle swarm optimization to software testing
Evolutionary structural testing is an approach to automatically generating test cases that achieve high structural code coverage. It typically uses genetic algorithms (GAs) to sea...
Andreas Windisch, Stefan Wappler, Joachim Wegener
123
Voted
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
15 years 8 months ago
Memory Placement Techniques for Parallel Association Mining
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...
139
Voted
IJAC
2006
93views more  IJAC 2006»
15 years 3 months ago
On Word Reversing in Braid Groups
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...
Patrick Dehornoy, Bert Wiest