Sciweavers

796 search results - page 153 / 160
» Approximating the centroid is hard
Sort
View
EOR
2010
88views more  EOR 2010»
13 years 7 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan
AI
2006
Springer
13 years 7 months ago
Constraint-based optimization and utility elicitation using the minimax decision criterion
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
Craig Boutilier, Relu Patrascu, Pascal Poupart, Da...
BMCBI
2006
116views more  BMCBI 2006»
13 years 7 months ago
MICA: desktop software for comprehensive searching of DNA databases
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
William A. Stokes, Benjamin S. Glick
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 7 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
CPHYSICS
2006
128views more  CPHYSICS 2006»
13 years 7 months ago
MOMDIS: a Glauber model computer code for knockout reactions
A computer program is described to calculate momentum distributions in stripping and diffraction dissociation reactions. A Glauber model is used with the scattering wavefunctions ...
C. A. Bertulani, A. Gade