16091 search results - page 469 / 3219 » Solving |
198
Voted
LOGCOM
1998
15 years 6 months ago
1998
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...
164
click to vote
NETWORKS
1998
15 years 6 months ago
1998
This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple exec...
200
Voted
SIAMCOMP
1998
15 years 6 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
169
click to vote
TJS
2002
15 years 6 months ago
2002
The formulation, implementation and performance of a new fully implicit parallel model of the ocean circulation is presented. Within this model, steady states can be traced in one ...
168
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...