Sciweavers

1963 search results - page 221 / 393
» The Maximum Solution Problem on Graphs
Sort
View
87
Voted
TROB
2008
112views more  TROB 2008»
15 years 21 days ago
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
Mike Peasgood, Christopher M. Clark, John McPhee
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
15 years 4 months ago
The role of diverse populations in phylogenetic analysis
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
Tiffani L. Williams, Marc L. Smith
CPAIOR
2008
Springer
15 years 2 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
106
Voted
EUROSYS
2006
ACM
15 years 10 months ago
On the road to recovery: restoring data after disasters
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
Kimberly Keeton, Dirk Beyer 0002, Ernesto Brau, Ar...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 2 months ago
Parsimonious regularization using genetic algorithms applied to the analysis of analytical ultracentrifugation experiments
Frequently in the physical sciences experimental data are analyzed to determine model parameters using techniques known as parameter estimation. Eliminating the effects of noise ...
Emre H. Brookes, Borries Demeler