Sciweavers

10718 search results - page 636 / 2144
» On the Circuit Implementation Problem
Sort
View
CP
1998
Springer
15 years 11 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
200
Voted
AIPS
2006
15 years 8 months ago
Lemma Reusing for SAT based Planning and Scheduling
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, K...
205
Voted
ICCV
2009
IEEE
15 years 5 months ago
Improving accuracy of geometric parameter estimation using projected score method
A fundamental problem in computer vision (CV) is the estimation of geometric parameters from multiple observations obtained from images; examples of such problems range from ellip...
Takayuki Okatani, Koichiro Deguchi
167
Voted
CVPR
2007
IEEE
16 years 9 months ago
A practical algorithm for L triangulation with outliers
This paper addresses the problem of robust optimal multi-view triangulation. We propose an abstract framework, as well as a practical algorithm, which finds the best 3D reconstruc...
Hongdong Li
ICDE
2000
IEEE
101views Database» more  ICDE 2000»
16 years 8 months ago
DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes
This paper introduces the concept of letting an RDBMS Optimizer optimize its own environment. In our project, we have used the DB2 Optimizer to tackle the index selection problem,...
Gary Valentin, Michael Zuliani, Daniel C. Zilio, G...