Sciweavers

1441 search results - page 76 / 289
» Multiple instance ranking
Sort
View
ENDM
2010
100views more  ENDM 2010»
13 years 10 months ago
Large-scale multi-period precedence constrained knapsack problem: A mining application
We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...
Eduardo Moreno, Daniel G. Espinoza, Marcos Goycool...
IJCAI
2003
13 years 11 months ago
Multiple Agents Moving Target Search
Traditional single-agent search algorithms usually make simplifying assumptions (single search agent, stationary target, complete knowledge of the state, and sufficient time). The...
Mark Goldenberg, Alexander Kovarsky, Xiaomeng Wu, ...
ANOR
2011
131views more  ANOR 2011»
13 years 5 months ago
A branch-and-bound algorithm for hard multiple knapsack problems
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
Alex S. Fukunaga
FSTTCS
2005
Springer
14 years 3 months ago
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation
Abstract. We consider exchange economies where the traders’ preferences are expressed in terms of the extensively used constant elasticity of substitution (CES) utility functions...
Bruno Codenotti, Benton McCune, Sriram Penumatcha,...
ICDCS
2007
IEEE
14 years 1 months ago
Build One, Get One Free: Leveraging the Coexistence of Multiple P2P Overlay Networks
Many different P2P overlay networks providing various functionalities, targeting specific applications, have been proposed in the past five years. It is now reasonable to consider...
Balasubramaneyam Maniymaran, Marin Bertier, Anne-M...