Sciweavers

1689 search results - page 149 / 338
» Proximate point searching
Sort
View
WWW
2001
ACM
16 years 6 months ago
Wireless Access to a Content Routing System
We present in this paper our experience in providing a wireless access interface to a distributed content search and delivery system. Important Wireless Application Protocol(WAP) ...
Junbiao Zhang, Remo Strotkamp
133
Voted
ECSQARU
2005
Springer
15 years 11 months ago
Default Clustering from Sparse Data Sets
Categorization with a very high missing data rate is seldom studied, especially from a non-probabilistic point of view. This paper proposes a new algorithm called default clusterin...
Julien Velcin, Jean-Gabriel Ganascia
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
15 years 10 months ago
Benchmarking the NEWUOA on the BBOB-2009 function testbed
The NEWUOA which belongs to the class of Derivative-Free optimization algorithms is benchmarked on the BBOB-2009 noisefree testbed. A multistart strategy is applied with a maximum...
Raymond Ros
IJCAI
2003
15 years 7 months ago
Sampling Combinatorial Spaces Using Biased Random Walks
For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can ...
Jordan Erenrich, Bart Selman
ERCIMDL
2010
Springer
157views Education» more  ERCIMDL 2010»
15 years 6 months ago
Overview and Results of the INEX 2009 Interactive Track
We present results of the INEX 2009 Interactive Track which focussed on how users behave in interactive search systems. Three types of working tasks based on a collection of book m...
Thomas Beckers, Norbert Fuhr, Nils Pharo, Ragnar N...