Sciweavers

9719 search results - page 182 / 1944
» Answer Set Optimization
Sort
View
EOR
2007
123views more  EOR 2007»
15 years 6 months ago
Dynamic programming analysis of the TV game "Who wants to be a millionaire?"
This paper uses dynamic programming to investigate when contestants should use lifelines or when they should just stop answering in the TV quiz show ‘Who wants to be a millionai...
Federico Perea, Justo Puerto
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
16 years 3 days 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
MOR
2008
73views more  MOR 2008»
15 years 6 months ago
Separation of Nonconvex Sets with General Augmenting Functions
In this paper, we consider two geometric optimization problems that are dual to each other and characterize conditions under which the optimal values of the two problems are equal...
Angelia Nedic, Asuman E. Ozdaglar
PAMI
2007
113views more  PAMI 2007»
15 years 6 months ago
Dominant Sets and Pairwise Clustering
—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
Massimiliano Pavan, Marcello Pelillo
ICCTA
2007
IEEE
16 years 26 days ago
Covering a Set of Points in a Plane Using Two Parallel Rectangles
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
Chandan Saha, Sandip Das