6598 search results - page 54 / 1320 » Graph Theory with Applications |
122
click to vote
CHI
2007
ACM
16 years 4 months ago
2007
ACM
Designing mobile and wearable applications is a challenge. The context of use is more important than ever and traditional methodologies for elicitation and specification reach the...
144
click to vote
UAI
1993
15 years 5 months ago
1993
In this paper some initialwork towards a new approach to qualitative reasoning under uncertainty is presented. This method is not only applicable to qualitative probabilistic reas...
130
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
136
Voted
JODS
2007
15 years 3 months ago
2007
This paper describes a theoretical framework for inducing knowledge from incomplete data sets. The general framework can be used with any formalism based on a lattice structure. It...
140
click to vote
CAP
2010
14 years 11 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...