Sciweavers

550 search results - page 49 / 110
» Decision-Theoretic Simulated Annealing
Sort
View
EVOW
2008
Springer
13 years 11 months ago
Reconstruction of Networks from Their Betweenness Centrality
Abstract. In this paper we study the reconstruction of a network topology from the values of its betweenness centrality, a measure of the influence of each of its nodes in the diss...
Francesc Comellas, Juan Paz-Sánchez
ISPE
2003
13 years 10 months ago
Negotiation algorithms for collaborative design settings
: Work to date on computational models of negotiation has focused almost exclusively on defining agreements consisting of one or a few independent issues. The negotiation involved ...
Mark Klein, Peyman Faratin, Hiroki Sayama, Yaneer ...
COLING
1994
13 years 10 months ago
A Part-of-Speech-Based Alignment Algorithm
To align bilingual texts becomes a crucial issue recently. Rather than using length-based or translation-based criterion, a part-of-speech-based criterion is proposed. We postulat...
Kuang-Hua Chen, Hsin-Hsi Chen
COR
2006
80views more  COR 2006»
13 years 9 months ago
Multiple crossdocks with inventory and time windows
Crossdocking studies have mostly been concerned with the physical layout of a crossdock or on a single crossdock. In this work, we study a network of crossdocks taking into consid...
Ping Chen, Yunsong Guo, Andrew Lim, Brian Rodrigue...
COR
2006
86views more  COR 2006»
13 years 9 months ago
Heuristics for a bidding problem
In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-b...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu