Sciweavers

110 search results - page 8 / 22
» Solving a Practical Examination Timetabling Problem: A Case ...
Sort
View
LOGCOM
1998
132views more  LOGCOM 1998»
13 years 7 months ago
Agents That Reason and Negotiate by Arguing
The need for negotiation in multi-agent systems stems from the requirement for agents to solve the problems posed by their interdependence upon one another. Negotiation provides a...
Simon Parsons, Carles Sierra, Nicholas R. Jennings
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
14 years 15 days ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
SIMULATION
1998
177views more  SIMULATION 1998»
13 years 7 months ago
Simulation and Planning of an Intermodal Container Terminal
A decision support system for the management of an intermodal container terminal is presented. Among the problems to be solved, there are the spatial allocation of containers on t...
Luca Maria Gambardella, Andrea Emilio Rizzoli, Mar...
AAAI
1992
13 years 8 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
MP
2008
105views more  MP 2008»
13 years 7 months ago
On the strength of Gomory mixed-integer cuts as group cuts
Gomory mixed-integer (GMI) cuts generated from optimal simplex tableaus are known to be useful in solving mixed-integer programs. Further, it is well-known that GMI cuts can be de...
Sanjeeb Dash, Oktay Günlük