Sciweavers

92 search results - page 18 / 19
» Generating Shorter Bases for Hard Random Lattices
Sort
View
KDD
2003
ACM
205views Data Mining» more  KDD 2003»
14 years 5 months ago
The data mining approach to automated software testing
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
Mark Last, Menahem Friedman, Abraham Kandel
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 2 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
CGO
2008
IEEE
13 years 12 months ago
Cole: compiler optimization level exploration
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
Kenneth Hoste, Lieven Eeckhout
ATAL
2005
Springer
13 years 11 months ago
A multiagent system manages collaboration in emergent processes
Emergent processes are non-routine, collaborative business processes whose execution is guided by the knowledge that emerges during a process instance. In so far as the process go...
John K. Debenham
ATAL
2003
Springer
13 years 10 months ago
Towards a pareto-optimal solution in general-sum games
Multiagent learning literature has investigated iterated twoplayer games to develop mechanisms that allow agents to learn to converge on Nash Equilibrium strategy profiles. Such ...
Sandip Sen, Stéphane Airiau, Rajatish Mukhe...