Sciweavers

738 search results - page 110 / 148
» Exploiting Locality in Searching the Web
Sort
View
MICAI
2004
Springer
15 years 5 months ago
A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
María Auxilio Osorio Lama, David Pinto
AAAI
2010
15 years 1 months ago
g-Planner: Real-time Motion Planning and Global Navigation using GPUs
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
Jia Pan, Christian Lauterbach, Dinesh Manocha
ACL
2004
15 years 1 months ago
Annealing Techniques For Unsupervised Statistical Language Learning
Exploiting unannotated natural language data is hard largely because unsupervised parameter estimation is hard. We describe deterministic annealing (Rose et al., 1990) as an appea...
Noah A. Smith, Jason Eisner
AMC
2006
115views more  AMC 2006»
14 years 12 months ago
A memetic algorithm for a vehicle routing problem with backhauls
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
Reza Tavakkoli-Moghaddam, A. R. Saremi, M. S. Ziae...
CONSTRAINTS
2006
120views more  CONSTRAINTS 2006»
14 years 12 months ago
Constraint Models for the Covering Test Problem
Covering arrays can be applied to the testing of software, hardware and advanced materials, and to the effects of hormone interaction on gene expression. In this paper we develop c...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...