Sciweavers

2996 search results - page 45 / 600
» Dynamic Traveling Repairperson Problem for dynamic systems
Sort
View
RECOMB
2005
Springer
16 years 4 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...
DCOSS
2010
Springer
15 years 7 months ago
Data Spider: A Resilient Mobile Basestation Protocol for Efficient Data Collection in Wireless Sensor Networks
Traditional deployments of wireless sensor networks (WSNs) rely on static basestations to collect data. For applications with highly spatio-temporal and dynamic data generation, su...
Onur Soysal, Murat Demirbas
GCC
2003
Springer
15 years 9 months ago
Distributed Computation for Diffusion Problem in a P2P-Enhanced Computing System
Basic exploration of diffusion equation solvers in distributed computing systems has been a very important issue for computational fluid dynamics (CFD). This paper presents a funda...
Jun Ni, Lili Huang, Tao He, Yongxiang Zhang, Shaow...
CASES
2008
ACM
15 years 6 months ago
Dynamic coprocessor management for FPGA-enhanced compute platforms
Various commercial programmable compute platforms have their processor architecture enhanced with field-programmable gate arrays (FPGAs). In a common usage scenario, an applicatio...
Chen Huang, Frank Vahid
145
Voted
USENIX
2000
15 years 5 months ago
Dynamic Function Placement for Data-Intensive Cluster Computing
Optimally partitioning application and filesystem functionality within a cluster of clients and servers is a difficult problem due to dynamic variations in application behavior, r...
Khalil Amiri, David Petrou, Gregory R. Ganger, Gar...