Sciweavers

2519 search results - page 243 / 504
» Martingales and Locality in Distributed Computing
Sort
View
PPSN
2010
Springer
13 years 8 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
CIKM
2009
Springer
14 years 5 months ago
On the feasibility of multi-site web search engines
Web search engines are often implemented as centralized systems. Designing and implementing a Web search engine in a distributed environment is a challenging engineering task that...
Ricardo A. Baeza-Yates, Aristides Gionis, Flavio J...
ICRA
2002
IEEE
146views Robotics» more  ICRA 2002»
14 years 3 months ago
Real-Time Combinatorial Tracking of a Target Moving Unpredictably among Obstacles
Abstract—Many applications require continuous monitoring of a moving target by a controllable vision system. Although the goal of tracking objects is not new, traditional techniq...
Héctor H. González-Baños, Che...
HPCA
2007
IEEE
14 years 4 months ago
Optical Interconnect Opportunities for Future Server Memory Systems
This paper deals with alternative server memory architecture options in multicore CPU generations using optically-attached memory systems. Thanks to its large bandwidth-distance p...
Y. Katayama, A. Okazaki
INFOCOM
2003
IEEE
14 years 3 months ago
Target-Pursuing Policies for Open Multiclass Queueing Networks
—We propose a new parametric class of scheduling and routing policies for open multiclass queueing networks. We establish their stability and show they are amenable to distribute...
Ioannis Ch. Paschalidis, Chang Su, Michael Caraman...