432 search results - page 78 / 87 » The Interleaving Problem in Program Understanding |
100
click to vote
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
84
Voted
INFSOF
2007
14 years 11 months ago
2007
Creating and maintaining software systems is a knowledge intensive task. One needs to have a good understanding of the application domain, the problem to solve and all its require...
118
click to vote
CLUSTER
2000
IEEE
14 years 11 months ago
2000
IEEE
With the increasing number of scientific applications manipulating huge amounts of data, effective high-level data management is an increasingly important problem. Unfortunately, ...
111
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...