Sciweavers

11160 search results - page 94 / 2232
» Incompleteness in a General Setting
Sort
View
ECSQARU
2009
Springer
14 years 1 months ago
A Generalization of the Pignistic Transform for Partial Bet
The Transferable Belief Model is a powerful interpretation of belief function theory where decision making is based on the pignistic transform. Smets has proposed a generalization ...
Thomas Burger, Alice Caplier
COR
2010
150views more  COR 2010»
13 years 10 months ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...
SIAMDM
2000
103views more  SIAMDM 2000»
13 years 9 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman
MP
1998
113views more  MP 1998»
13 years 9 months ago
Generalized semi-infinite optimization: A first order optimality condition and examples
We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP) min{f(x) Ix E M}, where M = {x E N"lhi(x ) = 0, i = 1,...,m, G(x,y) /> 0, y E Y(x)} ...
Hubertus Th. Jongen, Jan-J. Rückmann, Oliver ...
WG
2010
Springer
13 years 8 months ago
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlo...