Sciweavers

8746 search results - page 412 / 1750
» Diversifying search results
Sort
View
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
16 years 4 days ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig
ICDCS
2002
IEEE
15 years 12 months ago
Improving Search in Peer-to-Peer Networks
Peer-to-peer systems have emerged as a popular way to share huge volumes of data. The usability of these systems depends on effective techniques to find and retrieve data; howeve...
Beverly Yang, Hector Garcia-Molina
GECCO
2009
Springer
15 years 11 months ago
Search based data sensitivity analysis applied to requirement engineering
Software engineering is plagued by problems associated with unreliable cost estimates. This paper introduces an approach to sensitivity analysis for requirements engineering. It u...
Mark Harman, Jens Krinke, Jian Ren, Shin Yoo
HM
2009
Springer
145views Optimization» more  HM 2009»
15 years 11 months ago
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
Sandro Pirkwieser, Günther R. Raidl
ECAI
2000
Springer
15 years 11 months ago
Search Pruning Conditions for Boolean Optimization
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
Vasco M. Manquinho, João P. Marques Silva