Sciweavers

3320 search results - page 371 / 664
» Heuristics for the Phylogeny Problem
Sort
View
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 11 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
AIPS
2000
15 years 8 months ago
On-line Scheduling via Sampling
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong
CORR
2006
Springer
132views Education» more  CORR 2006»
15 years 6 months ago
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...
GLOBECOM
2010
IEEE
15 years 4 months ago
Routing and Spectrum Allocation in OFDM-Based Optical Networks with Elastic Bandwidth Allocation
Orthogonal Frequency Division Multiplexing (OFDM) has been recently proposed as a modulation technique for optical networks, due to its good spectral efficiency and impairment tole...
Kostas Christodoulopoulos, Ioannis Tomkos, Emmanou...
DAC
2003
ACM
16 years 7 months ago
Extending the lifetime of a network of battery-powered mobile devices by remote processing: a markovian decision-based approach
This paper addresses the problem of extending the lifetime of a batterypowered mobile host in a client-server wireless network by using task migration and remote processing. This ...
Peng Rong, Massoud Pedram