Sciweavers

2340 search results - page 35 / 468
» Copying and Comparing: Problems and Solutions
Sort
View
EOR
2006
139views more  EOR 2006»
14 years 11 months ago
A critical-shaking neighborhood search for the yard allocation problem
The yard allocation problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). As the problem is NP-hard, we propose an effective met...
Andrew Lim, Zhou Xu
ITS
2010
Springer
182views Multimedia» more  ITS 2010»
14 years 10 months ago
An Interactive Learning Environment for Problem-Changing Exercise
: To make a new problem from the original one and to compare their solutions are promising activities to promote a learner to be aware of the structure of these problems. Especiall...
Tsukasa Hirashima, Sho Yamamoto, Hiromi Waki
HICSS
2005
IEEE
134views Biometrics» more  HICSS 2005»
15 years 5 months ago
A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
15 years 6 months ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
CEAS
2006
Springer
15 years 3 months ago
CC Prediction with Graphical Models
We address the problem of suggesting who to add as an additional recipient (i.e. cc, or carbon copy) for an email under composition. We address the problem using graphical models ...
Chris Pal