Sciweavers

2681 search results - page 42 / 537
» Problem F
Sort
View
WEBDB
2004
Springer
80views Database» more  WEBDB 2004»
14 years 2 months ago
Unraveling the Duplicate-Elimination Problem in XML-to-SQL Query Translation
We consider the scenario where existing relational data is exported as XML. In this context, we look at the problem of translating XML queries into SQL. XML query languages have t...
Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F...
AAAI
2007
13 years 11 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
JCO
2008
134views more  JCO 2008»
13 years 8 months ago
On minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
JSAT
2006
114views more  JSAT 2006»
13 years 8 months ago
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
Miguel F. Anjos
EOR
2008
80views more  EOR 2008»
13 years 8 months ago
An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
The car sequencing problem consists in sequencing a given set of cars to be produced in a single day. We address one of the variants of this problem, in which the objective of mini...
Celso C. Ribeiro, Daniel Aloise, Thiago F. Noronha...