Sciweavers

658 search results - page 32 / 132
» Partially Ordered Constraint Optimization Problems
Sort
View
NETWORKS
2008
14 years 9 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
ICCV
2007
IEEE
15 years 11 months ago
Classification of Weakly-Labeled Data with Partial Equivalence Relations
In many vision problems, instead of having fully labeled training data, it is easier to obtain the input in small groups, where the data in each group is constrained to be from th...
Sanjiv Kumar, Henry A. Rowley
TIT
2010
101views Education» more  TIT 2010»
14 years 4 months ago
Wideband fading channel capacity with training and partial feedback
We consider the capacity of a wideband fading channel with partial feedback, subject to an average power constraint. A doubly block Rayleigh fading model is assumed with finite co...
Manish Agarwal, Michael L. Honig
ECAI
2006
Springer
15 years 1 months ago
Enhancing Constraints Manipulation in Semiring-Based Formalisms
Abstract. Many "semiring-like" structures are used in Soft Constraint Satisfaction Problems (SCSPs). We review a few properties of semirings that are useful for dealing w...
Stefano Bistarelli, Fabio Gadducci
SEFM
2009
IEEE
15 years 4 months ago
Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
Davide Bresolin, Valentin Goranko, Angelo Montanar...