Sciweavers

583 search results - page 36 / 117
» Efficient algorithms for constructing decision trees with co...
Sort
View
ATAL
2003
Springer
15 years 2 months ago
Constructing optimal policies for agents with constrained architectures
Optimal behavior is a very desirable property of autonomous agents and, as such, has received much attention over the years. However, making optimal decisions and executing optima...
Dmitri A. Dolgov, Edmund H. Durfee
AHSWN
2008
92views more  AHSWN 2008»
14 years 9 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
AINA
2009
IEEE
15 years 4 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
TON
2002
144views more  TON 2002»
14 years 9 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
SIAMCOMP
2002
153views more  SIAMCOMP 2002»
14 years 9 months ago
A Decision Procedure for Unitary Linear Quantum Cellular Automata
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
Christoph Dürr, Miklos Santha