Sciweavers

362 search results - page 36 / 73
» A distributed auction algorithm for the assignment problem
Sort
View
PVM
2004
Springer
14 years 4 months ago
Neighborhood Composition: A Parallelization of Local Search Algorithms
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Mas...
CVPR
2000
IEEE
15 years 21 days ago
Structure from Motion without Correspondence
A method is presented to recover 3D scene structure and camera motion from multiple images without the need for correspondence information. The problem is framed as finding the ma...
Frank Dellaert, Steven M. Seitz, Charles E. Thorpe...
IWCMC
2006
ACM
14 years 4 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan
IMC
2003
ACM
14 years 4 months ago
Virtual landmarks for the internet
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
Liying Tang, Mark Crovella
ATAL
2010
Springer
13 years 11 months ago
Automated negotiation with decommitment for dynamic resource allocation in cloud computing
We consider the problem of allocating networked resources in dynamic environment, such as cloud computing platforms, where providers strategically price resources to maximize thei...
Bo An, Victor R. Lesser, David Irwin, Michael Zink