Sciweavers

598 search results - page 80 / 120
» A Deterministic Metaheuristic Approach Using
Sort
View
TRANSCI
2010
101views more  TRANSCI 2010»
13 years 7 months ago
Computing Time-Dependent Bid Prices in Network Revenue Management Problems
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
Sumit Kunnumkal, Huseyin Topaloglu
CPAIOR
2007
Springer
14 years 3 months ago
Modeling the Regular Constraint with Integer Programming
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
Marie-Claude Côté, Bernard Gendron, L...
ATAL
2004
Springer
14 years 2 months ago
Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions
Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among ...
Benoît Hudson, Tuomas Sandholm
CSB
2003
IEEE
101views Bioinformatics» more  CSB 2003»
14 years 2 months ago
Stochastic Stage-structured Modeling of the Adaptive Immune System
We have constructed a computer model of the cytotoxic T lymphocyte (CTL) response to antigen and the maintenance of immunological memory. Because immune responses often begin with...
Dennis L. Chao, Miles P. Davenport, Stephanie Forr...
AAAI
2010
13 years 10 months ago
Can Approximation Circumvent Gibbard-Satterthwaite?
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
Ariel D. Procaccia