Sciweavers

1095 search results - page 44 / 219
» Preprocessing of Intractable Problems
Sort
View
AAAI
2008
14 years 12 days ago
Hybrid Constraint Tightening for Solving Hybrid Scheduling Problems
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
James C. Boerkoel Jr., Edmund H. Durfee
AAAI
1996
13 years 11 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
SIBGRAPI
2005
IEEE
14 years 3 months ago
A Maximum Uncertainty LDA-Based Approach for Limited Sample Size Problems : With Application to Face Recognition
A critical issue of applying Linear Discriminant Analysis (LDA) is both the singularity and instability of the within-class scatter matrix. In practice, particularly in image recog...
Carlos E. Thomaz, Duncan Fyfe Gillies
CVGIP
2000
124views more  CVGIP 2000»
13 years 10 months ago
Hierarchical Solutions for the Deformable Surface Problem in Visualization
In this paper we present a hierarchical approach for the deformable surface technique. This technique is a three dimensional extension of the snake segmentation method. We use it ...
Christoph Lürig, Leif Kobbelt, Thomas Ertl
INFOCOM
2007
IEEE
14 years 4 months ago
Toward Tractable Computation of the Capacity of Multi-Hop Wireless Networks
— By posing the problem of bandwidth allocation as a constrained maximization problem, it is possible to study various features of optimal bandwidth allocation, and hence the cap...
Stephan Bohacek, Peng Wang