836 search results - page 38 / 168 » On the Complexity of Train Assignment Problems |
189
click to vote
CSR
2007
Springer
16 years 4 days ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
159
click to vote
MICS
2010
15 years 4 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
132
click to vote
WSC
2008
15 years 8 months ago
2008
Maritime terminals of pure transhipment are emerging logistic realities in long-distance containerized trade. Here, complex activities of resource allocation and scheduling should...
149
click to vote
GECCO
2007
Springer
16 years 3 days ago
2007
Springer
Imagine a group of cooperating agents attempting to allocate tasks amongst themselves without knowledge of their own capabilities. Over time, they develop a belief of their own sk...
161
click to vote
MOBIHOC
2006
ACM
16 years 5 months ago
2006
ACM
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...