11740 search results - page 114 / 2348 » More Problems in Rewriting |
102
Voted
IPPS
2008
IEEE
15 years 7 months ago
2008
IEEE
—Scheduling and dispatching are two ways of solving production planning problems. In this work, based on preceding works, it is explained how these two approaches can be combined...
ICTAI
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
83
Voted
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper introduces the notion of Run Transferable Libraries, a mechanism to pass knowledge acquired in one GP run to another. We demonstrate that a system using these ...
122
click to vote
CIKM
2003
Springer
15 years 6 months ago
2003
Springer
Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future? We formalize this question as the link predicti...
52
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract— We investigate an optimal consumption and investment problem where we receive a certain fixed income stream that is terminated at a random time. It turns out that the ...