Sciweavers

2340 search results - page 40 / 468
» Copying and Comparing: Problems and Solutions
Sort
View
CP
2005
Springer
15 years 5 months ago
Solving the Car-Sequencing Problem as a Non-binary CSP
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
Mihaela Butaru, Zineb Habbas
SDM
2009
SIAM
219views Data Mining» more  SDM 2009»
15 years 9 months ago
A Hybrid Data Mining Metaheuristic for the p-Median Problem.
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
Alexandre Plastino, Erick R. Fonseca, Richard Fuch...
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
14 years 11 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
ESE
2000
102views Database» more  ESE 2000»
14 years 11 months ago
Picking the Right Problem Frame-An Empirical Study
Problem frames are a relatively new approach to requirements engineering, promising benefits not only in elicitation but also in subsequent design, by allowing their users to selec...
Keith Phalp, Karl Cox
RECOMB
2010
Springer
15 years 6 months ago
The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
Bjarni V. Halldórsson, Derek Aguiar, Ryan T...