Sciweavers

4313 search results - page 327 / 863
» Using time travel to diagnose computer problems
Sort
View
231
Voted
APNOMS
2009
Springer
15 years 5 months ago
Network Partitioning and Self-sizing Methods for QoS Management with Autonomic Characteristics
The inherent and increasing complexity, heterogeneity and unpredictability of computer networks make the task of managing these systems highly complex. The autonomic computing para...
Romildo Martins da Silva Bezerra, Joberto Sé...
SOFSEM
2010
Springer
16 years 4 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
FSTTCS
2008
Springer
15 years 8 months ago
Explicit Muller Games are PTIME
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
Florian Horn
INFORMS
2010
100views more  INFORMS 2010»
15 years 4 months ago
Two-Step MIR Inequalities for Mixed Integer Programs
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
Sanjeeb Dash, Marcos Goycoolea, Oktay Günl&uu...
219
Voted
STACS
2007
Springer
16 years 1 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...