Sciweavers

3145 search results - page 410 / 629
» Algebraic Linear Orderings
Sort
View
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
16 years 6 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
VLDB
2007
ACM
130views Database» more  VLDB 2007»
16 years 6 months ago
A framework for efficient regression tests on database applications
Regression testing is an important software maintenance activity to ensure the integrity of a software after modification. However, most methods and tools developed for software te...
Florian Haftmann, Donald Kossmann, Eric Lo
ICSE
2004
IEEE-ACM
16 years 6 months ago
Efficient Decentralized Monitoring of Safety in Distributed Systems
We describe an efficient decentralized monitoring algorithm that monitors a distributed program's execution to check for violations of safety properties. The monitoring is ba...
Koushik Sen, Abhay Vardhan, Gul Agha, Grigore Rosu
STACS
2010
Springer
16 years 1 months ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
16 years 1 months ago
A MILP-based approach to path sensitization of embedded software
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
José C. Costa, José C. Monteiro