4843 search results - page 141 / 969 » The Shortcut Problem - Complexity and Approximation |
128
click to vote
SIAMSC
2011
14 years 10 months ago
2011
We propose a numerical method to approximate the solution of second order elliptic problems in nonvariational form. The method is of Galerkin type using conforming finite elements...
127
click to vote
SARA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
148
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
140
click to vote
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
142
click to vote
IPCO
2004
15 years 4 months ago
2004
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...