Sciweavers

2354 search results - page 15 / 471
» Radio number for trees
Sort
View
77
Voted
AAAI
2010
14 years 11 months ago
Parallel Depth First Proof Number Search
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
Tomoyuki Kaneko
JSYML
2008
100views more  JSYML 2008»
14 years 9 months ago
Measurable chromatic numbers
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three...
Benjamin D. Miller
SECON
2007
IEEE
15 years 3 months ago
Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
Anand Prabhu Subramanian, Himanshu Gupta, Samir R....
AINTEC
2007
Springer
15 years 3 months ago
Quality-of-Service Multicast Overlay Spanning Tree Algorithms for Wireless Ad Hoc Networks
In this article, we explore modified versions of Multicast Overlay Spanning Tree algorithms (MOST) to support quality of service for wireless ad hoc networks. These algorithms (Q-...
Georgios Rodolakis, Cedric Adjih, Anis Laouiti, Sa...
JSAC
2011
134views more  JSAC 2011»
14 years 4 months ago
Simple Channel Sensing Order in Cognitive Radio Networks
— In cognitive radio networks (CRNs), effective and efficient channel exploitation is imperative for unlicensed secondary users to seize available network resources and improve ...
Ho Ting Cheng, Weihua Zhuang