Sciweavers

3433 search results - page 21 / 687
» Heuristics for a bidding problem
Sort
View
CP
2005
Springer
14 years 1 months ago
Solving the Car-Sequencing Problem as a Non-binary CSP
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
Mihaela Butaru, Zineb Habbas
CP
2007
Springer
14 years 1 months ago
Reformulating CSPs for Scalability with Application to Geospatial Reasoning
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...
EOR
2002
67views more  EOR 2002»
13 years 7 months ago
Solving the multiple competitive facilities location problem
In this paper we propose five heuristic procedures for the solution of the multiple competitive facilities location problem. A franchise of several facilities is to be located in ...
Tammy Drezner, Zvi Drezner, Said Salhi
ACMICEC
2005
ACM
160views ECommerce» more  ACMICEC 2005»
14 years 1 months ago
Autonomous trading agent design in the presence of tradeoffs
In previous work we have introduced a principled methodology for systematically exploring the space of bidding strategies when agents participate in a significant number of simul...
Ioannis A. Vetsikas, Bart Selman
WECWIS
2003
IEEE
118views ECommerce» more  WECWIS 2003»
14 years 26 days ago
Trade Determination in Multi-Attribute Exchanges
Electronic exchanges are double-sided marketplaces that allow multiple buyers to trade with multiple sellers, with aggregation of demand and supply across the bids to maximize the...
S. Kameshwaran, Y. Narahari