729 search results - page 66 / 146 » Solving subgraph isomorphism problems with constraint progra... |
156
click to vote
CONSTRAINTS
2008
15 years 3 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
137
click to vote
ICRA
1993
IEEE
15 years 7 months ago
1993
IEEE
cavity Recent advan.cesin cementless hip replacement surgery have significantly improved the accuracy of bone cavity preparation and custom implant shape design. With the increased...
147
Voted
CP
1997
Springer
15 years 8 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
129
click to vote
TASE
2008
IEEE
15 years 3 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
104
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—The problem of maximizing the sum of the transmit rates while limiting the outage probability below an appropriate threshold is investigated for networks where the nodes have li...