1012 search results - page 33 / 203 » Segment intersection searching problems in general settings |
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
ICPR
2000
IEEE
16 years 25 days ago
2000
IEEE
Most page segmentation algorithms have userspecifiable free parameters. However, algorithm designers typically do not provide a quantitative/rigorous method for choosing values fo...
92
Voted
AIEDAM
1998
14 years 11 months ago
1998
Gradient-based numerical optimization of complex engineering designs offers the promise of rapidly producing better designs. However, such methods generally assume that the object...
MOR
2006
14 years 11 months ago
2006
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...
AIR
2004
14 years 11 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...