16504 search results - page 54 / 3301 » New Problems, New Solutions |
147
click to vote
ICCBR
2010
Springer
15 years 2 months ago
2010
Springer
How to reuse or adapt past solutions to new problems is one of the least understood problems in case-based reasoning. In this paper we will focus on the problem of how to combine s...
148
click to vote
CPAIOR
2010
Springer
15 years 9 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
125
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
131
click to vote
MSS
2011
IEEE
14 years 11 months ago
2011
IEEE
We consider bargaining problems under the assumption that players are loss averse, i.e., experience disutility from obtaining an outcome lower than some reference point. We follow...
155
click to vote
CP
2009
Springer
15 years 11 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...