Sciweavers

3433 search results - page 188 / 687
» Heuristics for a bidding problem
Sort
View
AAAI
2006
15 years 8 months ago
Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...
Meinolf Sellmann, Carlos Ansótegui
NJC
1998
86views more  NJC 1998»
15 years 6 months ago
Parametric Permutation Routing via Matchings
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
Peter Høyer, Kim S. Larsen
185
Voted
COR
2007
134views more  COR 2007»
15 years 6 months ago
Portfolio selection using neural networks
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
Alberto Fernández, Sergio Gómez
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
16 years 1 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
ILP
2007
Springer
16 years 22 days ago
Applying Inductive Logic Programming to Process Mining
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...
Evelina Lamma, Paola Mello, Fabrizio Riguzzi, Serg...