454 search results - page 63 / 91 » On improving approximate solutions by evolutionary algorithm... |
158
click to vote
JMLR
2012
13 years 4 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
125
click to vote
ALENEX
2008
15 years 3 months ago
2008
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
110
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
120
click to vote
PVLDB
2010
14 years 12 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
120
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...