729 search results - page 73 / 146 » Solving subgraph isomorphism problems with constraint progra... |
123
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
156
click to vote
NIPS
2003
15 years 5 months ago
2003
This paper presents a method for learning a distance metric from relative comparison such as “A is closer to B than A is to C”. Taking a Support Vector Machine (SVM) approach,...
126
Voted
AUTOMATICA
2008
15 years 3 months ago
2008
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
130
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
142
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Relay power allocation has been shown to provide substantial performance gain in wireless relay channels when perfect global channel state information (CSI) is available. In th...