Sciweavers

2430 search results - page 181 / 486
» Computing Tutte Polynomials
Sort
View
AI
2007
Springer
15 years 4 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
ANOR
2002
99views more  ANOR 2002»
15 years 4 months ago
An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results
We introduce a distribution center (DC) location model that incorporates working inventory and safety stock inventory costs at the distribution centers. In addition, the model inco...
Mark S. Daskin, Collette R. Coullard, Zuo-Jun Max ...
BMCBI
2007
109views more  BMCBI 2007»
15 years 4 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
CVPR
2003
IEEE
16 years 6 months ago
A Novel Model for Orientation Field of Fingerprints
As a global feature of fingerprint, orientation field is very important to automatic fingerprint identification system (AFIS). Establishing an accurate and concise model for orien...
Jinwei Gu, Jie Zhou
ICCV
2003
IEEE
16 years 6 months ago
Globally Convergent Autocalibration
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...
Arrigo Benedetti, Alessandro Busti, Michela Farenz...