Sciweavers

6004 search results - page 620 / 1201
» Parallelizing query optimization
Sort
View
MOBICOM
2004
ACM
15 years 11 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu
GIS
2007
ACM
15 years 10 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
157
Voted
AAAI
1998
15 years 7 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
INTR
2007
120views more  INTR 2007»
15 years 6 months ago
Analysing Google rankings through search engine optimization data
Purpose – The purpose of this paper is to identify the most popular techniques used to rank a web page highly in Google. Design/methodology/approach – The paper presents the r...
Michael P. Evans
PODC
2009
ACM
16 years 6 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan