Sciweavers

9631 search results - page 20 / 1927
» The Costs of Using JXTA
Sort
View
TIM
2011
108views more  TIM 2011»
14 years 4 months ago
A Low-Cost Method for Measuring Surface Currents and Modeling Drifting Objects
—The ability to measure and model water currents is essential to ensure the safety and correct operations of many water surface activities. For example, the complex currents in h...
Huang-Chen Lee, Chun-Yu Lin, Chun-Han Lin, Sheng-W...
TON
2010
126views more  TON 2010»
14 years 4 months ago
Cost-Effective Multiperiod Spraying for Routing in Delay-Tolerant Networks
In this paper, we present a novel multiperiod spraying algorithm for routing in delay-tolerant networks (DTNs). The goal is to minimize the average copy count used per message unti...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski
JAIR
2000
123views more  JAIR 2000»
14 years 9 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
14 years 9 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
73
Voted
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 1 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert