Sciweavers

5606 search results - page 537 / 1122
» Randomization Techniques for Graphs.
Sort
View
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 10 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 8 months ago
Competitiveness via consensus
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
Andrew V. Goldberg, Jason D. Hartline
IR
2006
15 years 7 months ago
Table extraction for answer retrieval
The ability to find tables and extract information from them is a necessary component of many information retrieval tasks. Documents often contain tables in order to communicate d...
Xing Wei, W. Bruce Croft, Andrew McCallum
JCM
2007
191views more  JCM 2007»
15 years 7 months ago
Using Antenna Array Redundancy and Channel Diversity for Secure Wireless Transmissions
— The use of signal processing techniques to protect wireless transmissions is proposed as a way to secure wireless networks at the physical layer. This approach addresses a uniq...
Xiaohua Li, Juite Hwu, E. Paul Ratazzi
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
13 years 9 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...