982 search results - page 160 / 197 » Solving Steiner tree problems in graphs to optimality |
103
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
71
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
We propose a new methodology to look at the fitness contributions (semantics) of different schemata in Genetic Programming (GP). We hypothesize that the significance of a schem...
125
Voted
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
119
click to vote
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
125
click to vote
RIVF
2003
15 years 1 months ago
2003
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...