Sciweavers

212 search results - page 9 / 43
» Electoral search using the VerkiezingsKijker: an experience ...
Sort
View
ICSM
2006
IEEE
14 years 1 months ago
Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding
One approach to supporting program comprehension involves binding concepts to source code. Previously proposed approaches to concept binding have enforced nonoverlapping boundarie...
Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahda...
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
14 years 29 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
ATAL
2010
Springer
13 years 9 months ago
TacTex09: a champion bidding agent for ad auctions
In the Trading Agent Competition Ad Auctions Game, agents compete to sell products by bidding to have their ads shown in a search engine's sponsored search results. We report...
David Pardoe, Doran Chakraborty, Peter Stone
ECIR
1998
Springer
13 years 9 months ago
User-Chosen Phrases in Interactive Query Formulation for Information Retrieval
The impact of using phrases as content representation for documents and for queries has generally been accepted as a desirable feature in information retrieval systems because phr...
Alan F. Smeaton, Fergus Kelledy
22
Voted
JCO
1998
136views more  JCO 1998»
13 years 7 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...