Sciweavers

62 search results - page 12 / 13
» On Solving Efficiently the View Selection Problem under Bag-...
Sort
View
AAAI
2006
14 years 11 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
APIN
2000
120views more  APIN 2000»
14 years 9 months ago
Two-Loop Real-Coded Genetic Algorithms with Adaptive Control of Mutation Step Sizes
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
Francisco Herrera, Manuel Lozano
MOBIHOC
2007
ACM
15 years 9 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
IOR
2006
91views more  IOR 2006»
14 years 9 months ago
Robust One-Period Option Hedging
The paper considers robust optimization to cope with uncertainty about the stock return process in one period option hedging problems. The robust approach relates portfolio choice ...
Frank Lutgens, Jos F. Sturm, Antoon Kolen
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
15 years 10 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour