Sciweavers

431 search results - page 14 / 87
» Implementing the maximum of monotone algorithms
Sort
View
RECOMB
2005
Springer
15 years 10 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
INFOCOM
2007
IEEE
15 years 4 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
INFOCOM
1996
IEEE
15 years 1 months ago
ATM Rate Based Congestion Control Using a Smith Predictor: An EPRCA Implementation
This paper presents a feedback control algorithm for ATM congestion control in which source rates are adjusted according to VC queue lengths at intermediate nodes along the path. ...
Saverio Mascolo, Dirceu Cavendish, Mario Gerla
GECCO
2008
Springer
184views Optimization» more  GECCO 2008»
14 years 11 months ago
Analysis of mammography reports using maximum variation sampling
A genetic algorithm (GA) was developed to implement a maximum variation sampling technique to derive a subset of data from a large dataset of unstructured mammography reports. It ...
Robert M. Patton, Barbara G. Beckerman, Thomas E. ...
PODC
2009
ACM
15 years 10 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young