Sciweavers

6976 search results - page 157 / 1396
» The Oil Searching Problem
Sort
View
ECAI
2008
Springer
15 years 8 months ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson
NAACL
2007
15 years 8 months ago
Randomized Decoding for Selection-and-Ordering Problems
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
Pawan Deshpande, Regina Barzilay, David R. Karger
AIPS
1998
15 years 7 months ago
How to Solve It Automatically: Selection Among Problem Solving Methods
The choice of an appropriate problem-solving method, from available methods, is a crucial skill for experts in many areas. We describe a technique for the automatic selection amon...
Eugene Fink
EOR
2010
110views more  EOR 2010»
15 years 6 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
EOR
2008
91views more  EOR 2008»
15 years 6 months ago
Dominance-based heuristics for one-machine total cost scheduling problems
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
Antoine Jouglet, David Savourey, Jacques Carlier, ...