Sciweavers

4298 search results - page 314 / 860
» Measurable chromatic numbers
Sort
View
EMSOFT
2004
Springer
16 years 4 days ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
178
Voted
BIRTHDAY
2003
Springer
15 years 12 months ago
On the Pagination of Complex Documents
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
Anne Brüggemann-Klein, Rolf Klein, Stefan Woh...
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
15 years 12 months ago
Inherent Fault Tolerance in Evolved Sorting Networks
This poster paper summarizes our research on fault tolerance arising as a by-product of the evolutionary computation process. Past research has shown evidence of robustness emergin...
Rob Shepherd, James A. Foster
ANSS
2000
IEEE
15 years 11 months ago
Flow Control and Dynamic Load Balancing in Time Warp
We present, in this paper, an algorithm which integrates flow control and dynamic load balancing in Time Warp. The algorithm is intended for use in a distributed memory environme...
Myongsu Choe, Carl Tropper
FSTTCS
2006
Springer
15 years 10 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh