Sciweavers

1689 search results - page 58 / 338
» Proximate point searching
Sort
View
IEICET
2007
90views more  IEICET 2007»
13 years 10 months ago
Multi-Point Simulated Annealing with Adaptive Neighborhood
—When SA is applied to continuous optimization problems, the design of the neighborhood used in SA becomes important. A lot of experiments are necessary to determine an appropria...
Keiko Ando, Mitsunori Miki, Tomoyuki Hiroyasu
IMC
2006
ACM
14 years 4 months ago
A measurement-based deployment proposal for IP anycast
Despite its growing use in critical infrastructure services, the performance of IP(v4) Anycast and its interaction with IP routing practices is not well understood. In this paper,...
Hitesh Ballani, Paul Francis, Sylvia Ratnasamy
SIAMJO
2002
92views more  SIAMJO 2002»
13 years 10 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni
IJON
2007
96views more  IJON 2007»
13 years 10 months ago
Suppressive effects in visual search: A neurocomputational analysis of preview search
In the real world, visual information is selected over time as well as space, when we prioritise new stimuli for attention. Watson and Humphreys [Visual marking: prioritising sele...
Eirini Mavritsaki, Dietmar Heinke, Glyn W. Humphre...
ECOOP
2009
Springer
14 years 11 months ago
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
Guoqing Xu, Atanas Rountev, Manu Sridharan