Sciweavers

1933 search results - page 139 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
CATA
2010
15 years 5 months ago
Mixed-criticality Scheduling: Improved Resource-augmentation Results
Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different c...
Sanjoy K. Baruah, Haohan Li, Leen Stougie
RECOMB
2005
Springer
16 years 4 months ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal
ECRTS
2003
IEEE
15 years 9 months ago
Using Supertasks to Improve Processor Utilization in Multiprocessor Real-Time Systems
We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a ...
Philip Holman, James H. Anderson
AI
1998
Springer
15 years 3 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 8 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...