717 search results - page 132 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
IPCO
2007
14 years 11 months ago
2007
A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learnin...
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
ASAP
2004
IEEE
15 years 1 months ago
2004
IEEE
In this paper, we present a modular co-synthesis framework called CHARMED that solves the problem of hardware-software co-synthesis of periodic, multi-mode, distributed, embedded ...
EOR
2008
14 years 9 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
SPIRE
1999
Springer
15 years 2 months ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...