1576 search results - page 221 / 316 » Properties of Synthetic Optimization Problems |
159
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
133
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
146
Voted
ICML
2004
IEEE
15 years 9 months ago
2004
IEEE
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
137
Voted
DATE
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper, we present a system synthesis algorithm, called MOCSYN, which partitions and schedules embedded system specifications to intellectual property cores in an integrate...
137
Voted
NIPS
2003
15 years 5 months ago
2003
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...