54 search results - page 7 / 11 » Solving The Multi-Constrained Path Selection Problem By Usin... |
CG
2002
Springer
13 years 7 months ago
2002
Springer
Abstract. The paper introduces a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search, which performs at the first level a depth-first Proof-number and D...
ICDAR
2005
IEEE
14 years 1 months ago
2005
IEEE
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
ICRA
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract-- We propose a new method for automatically accessing an internet database of 3D models that are searchable only by their user-annotated labels, for using them for vision ...
ICCAD
2004
IEEE
14 years 4 months ago
2004
IEEE
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...
INFOCOM
2002
IEEE
14 years 18 days ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...