Sciweavers

279 search results - page 49 / 56
» Testing for Refinement in CSP
Sort
View
SIGSOFT
2005
ACM
15 years 10 months ago
Matching execution histories of program versions
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
Xiangyu Zhang, Rajiv Gupta
86
Voted
KDD
2001
ACM
145views Data Mining» more  KDD 2001»
15 years 10 months ago
Proximal support vector machine classifiers
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
Glenn Fung, Olvi L. Mangasarian
80
Voted
ICRA
2005
IEEE
184views Robotics» more  ICRA 2005»
15 years 3 months ago
3D Virtual Prototyping of Home Service Robots Using ASADAL/OBJ
– Typical robot development requires that hardware be mostly functional before significant software development begins. Utilizing virtual prototype of hardware and its environmen...
Kyo Chul Kang, Moonzoo Kim, Jaejoon Lee, Byungkil ...
AISB
1994
Springer
15 years 1 months ago
Formal Memetic Algorithms
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
Nicholas J. Radcliffe, Patrick D. Surry
GECCO
2008
Springer
184views Optimization» more  GECCO 2008»
14 years 10 months ago
Analysis of mammography reports using maximum variation sampling
A genetic algorithm (GA) was developed to implement a maximum variation sampling technique to derive a subset of data from a large dataset of unstructured mammography reports. It ...
Robert M. Patton, Barbara G. Beckerman, Thomas E. ...