Sciweavers

2252 search results - page 245 / 451
» Improving Random Forests
Sort
View
WCNC
2008
IEEE
15 years 7 months ago
A Resource Allocation Scheme for TH-UWB Networks with Multiple Sinks
Abstract—In this work, we study the time-slot allocation problem in a multi-sink single-hop TH-UWB network scenario, where the traffic from a sensor node is anycasted via a sing...
Hwee-Xian Tan, Mun-Choon Chan, Peng Yong Kong, Che...
ASIAMS
2007
IEEE
15 years 7 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
CIBCB
2007
IEEE
15 years 7 months ago
Overestimation for Multiple Sequence Alignment
Abstract— Multiple sequence alignment is an important problem in computational biology. A-star is an algorithm that can be used to find exact alignments. We present a simple mod...
Tristan Cazenave
ICDM
2007
IEEE
138views Data Mining» more  ICDM 2007»
15 years 7 months ago
Bandit-Based Algorithms for Budgeted Learning
We explore the problem of budgeted machine learning, in which the learning algorithm has free access to the training examples’ labels but has to pay for each attribute that is s...
Kun Deng, Chris Bourke, Stephen D. Scott, Julie Su...
ICPADS
2007
IEEE
15 years 7 months ago
On the relative value of local scheduling versus routing in parallel server systems
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
Rong Wu, Douglas G. Down