Sciweavers

400 search results - page 35 / 80
» Hard Problem Generation for MKP
Sort
View
DISOPT
2008
81views more  DISOPT 2008»
15 years 24 days ago
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
Matthias Köppe, Quentin Louveaux, Robert Weis...
118
Voted
SAC
2008
ACM
15 years 5 days ago
Whom should I trust?: the impact of key figures on cold start recommendations
Generating adequate recommendations for newcomers is a hard problem for a recommender system (RS) due to lack of detailed user profiles and social preference data. Empirical evide...
Patricia Victor, Chris Cornelis, Ankur Teredesai, ...
99
Voted
TII
2008
77views more  TII 2008»
15 years 18 days ago
The One-Shot Task Model for Robust Real-Time Embedded Control Systems
Embedded control systems are often implemented in small microprocessors enabled with real-time technology. In this context, control laws are often designed according to discrete-ti...
Camilo Lozoya, Manel Velasco, Pau Martí
94
Voted
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
15 years 4 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
15 years 1 months ago
Towards memoryless model building
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
David Iclanzan, Dumitru Dumitrescu