5316 search results - page 273 / 1064 » Which Search Problems Are Random |
143
click to vote
FSTTCS
2007
Springer
15 years 11 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
174
click to vote
AI
2008
Springer
15 years 5 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
132
click to vote
SIGIR
2009
ACM
15 years 11 months ago
2009
ACM
Type-ahead search is a new information-access paradigm, in which systems can find answers to keyword queries “onthe-fly” as a user types in a query. It improves traditional ...
162
click to vote
PREMI
2005
Springer
15 years 10 months ago
2005
Springer
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
150
Voted
CN
2010
15 years 5 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...