8413 search results - page 1399 / 1683 » Ordering Problem Subgoals |
117
click to vote
DEBU
2010
15 years 4 months ago
2010
A major hardness of processing searches issued in the form of keywords on structured data is the ambiguity problem. A set of keywords itself is not a complete piece of information...
148
click to vote
DM
2010
15 years 4 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
151
click to vote
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
15 years 4 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
119
click to vote
EOR
2010
15 years 4 months ago
2010
-- The classical Wardrop System Optimum (SO) assignment model assumes that the users will cooperate with each other in order to minimize the overall travel costs. The importance of...
161
click to vote
4OR
2006
15 years 4 months ago
2006
Sorting models consist in assigning alternatives evaluated on several criteria to ordered categories. To implement such models it is necessary to set the values of the preference p...