3656 search results - page 144 / 732 » Compact Location Problems |
ECAI
2006
Springer
15 years 2 months ago
2006
Springer
We use a lexicographical preference order on the problem space to combine solution synthesis with conflict learning. Given two preferred solutions of two subproblems, we can either...
94
Voted
ECIR
2010
Springer
15 years 2 months ago
2010
Springer
A promising way to accelerate similarity search is semantic hashing which designs compact binary codes for a large number of documents so that semantically similar documents are ma...
116
click to vote
PDPTA
2008
15 years 2 months ago
2008
- For an iterative process to be parallelized, the operations that comprise the process must be organized into a correct schedule that will allow the hardware to compute the task. ...
103
click to vote
IJCAI
2003
15 years 2 months ago
2003
We extend multiclass SVM to multiple prototypes per class. For this framework, we give a compact constrained quadratic problem and we suggest an efficient algorithm for its optimi...
IOR
2008
15 years 29 days ago
2008
In this paper, we address the optimal joint control of inventory and transshipment for a firm that produces in two locations and faces capacity uncertainty. Capacity uncertainty (...