Sciweavers

887 search results - page 62 / 178
» A Time for Choosing
Sort
View
CEEMAS
2005
Springer
14 years 2 months ago
The "Dance or Work" Problem: Why Do not all Honeybees Dance with Maximum Intensity
A honeybee colony has to choose among several nectar sources in the environment, each fluctuating in quality over time. Successful forager bees return to the hive and perform dance...
Ronald Thenius, Thomas Schmickl, Karl Crailsheim
INFOCOM
1999
IEEE
14 years 1 months ago
A Model for Window Based Flow Control in Packet-Switched Networks
Recently, networks have increased rapidly both in scale and speed. Problems related to the control and management are of increasing interest. The average throughput and end-to-end ...
Xiaowei Yang
JACIII
2008
148views more  JACIII 2008»
13 years 9 months ago
Optimal Route Based on Dynamic Programming for Road Networks
Abstract. One of the main functions of the traffic navigation systems is to find the optimal route to the destination. In this paper, we propose an iterative Q value updating algor...
Manoj Kanta Mainali, Kaoru Shimada, Shingo Mabu, K...
ICML
2006
IEEE
14 years 9 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
14 years 9 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo