Sciweavers

11160 search results - page 224 / 2232
» Incompleteness in a General Setting
Sort
View
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
16 years 17 days ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard
TACAS
2009
Springer
106views Algorithms» more  TACAS 2009»
16 years 16 days ago
Hierarchical Set Decision Diagrams and Regular Models
Abstract. This paper presents algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic modelchecking. We encod...
Yann Thierry-Mieg, Denis Poitrenaud, Alexandre Ham...
SCALESPACE
2009
Springer
16 years 9 days ago
On Level-Set Type Methods for Recovering Piecewise Constant Solutions of Ill-Posed Problems
We propose a regularization method for solving ill-posed problems, under the assumption that the solutions are piecewise constant functions with unknown level sets and unknown leve...
Adriano DeCezaro, Antonio Leitão, Xue-Cheng...
147
Voted
RECSYS
2009
ACM
16 years 8 days ago
Applying relevant set correlation clustering to multi-criteria recommender systems
This thesis investigates application of clustering to multi-criteria ratings as a method of improving the precision of top-N recommendations. With the advent of ecommerce sites th...
Nkechi Nnadi
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
15 years 11 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca