Sciweavers

7303 search results - page 1045 / 1461
» Optimality for dynamic patterns
Sort
View
WICON
2008
15 years 6 months ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal
178
Voted
FAST
2004
15 years 6 months ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing...
NETWORKING
2004
15 years 6 months ago
Traffic Grooming in WDM Ring Networks with the Min-Max Objective
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consid...
Bensong Chen, George N. Rouskas, Rudra Dutta
WMI
2001
114views more  WMI 2001»
15 years 6 months ago
A high capacity multihop packet CDMA wireless network
: An adhoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administra...
Ali Nabi Zadeh, Bijan Jabbari
AAAI
1997
15 years 6 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
« Prev « First page 1045 / 1461 Last » Next »