3433 search results - page 246 / 687 » Heuristics for a bidding problem |
219
click to vote
AI
2012
Springer
14 years 2 months ago
2012
Springer
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for eff...
192
click to vote
SAGA
2009
Springer
16 years 1 months ago
2009
Springer
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
154
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
158
click to vote
WSC
1997
15 years 8 months ago
1997
This paper presents an implementation methodology appropriate for providing a broad range of proven, classical Operations Research methods and techniques to the simulation modeler...
185
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Most models of utility elicitation in decision support and interactive optimization assume a predefined set of "catalog" features over which user preferences are express...