Sciweavers

2434 search results - page 183 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
ISMB
1997
15 years 5 months ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey
JAIR
2007
141views more  JAIR 2007»
15 years 3 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
CEC
2007
IEEE
15 years 10 months ago
Implicit alternative splicing for genetic algorithms
— In this paper we present a new nature-inspired variation operator for binary encodings in genetic algorithms (GAs). Our method, called implicit alternative splicing (iAS), is r...
Philipp Rohlfshagen, John A. Bullinaria
INFOCOM
2003
IEEE
15 years 9 months ago
User-Level Performance of Channel-Aware Scheduling Algorithms in Wireless Data Networks
— Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in...
Sem C. Borst
AIPS
2007
15 years 6 months ago
A Fast Incremental Algorithm for Maintaining Dispatchability of Partially Controllable Plans
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...
Julie A. Shah, John Stedl, Brian C. Williams, Paul...