Sciweavers

IPL
2006
97views more  IPL 2006»
13 years 5 months ago
A tight lower bound for job scheduling with cancellation
The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a t...
Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. F...
IPL
2006
72views more  IPL 2006»
13 years 5 months ago
Cayley graphs as models of deterministic small-world networks
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distinguishing characteristics of small-world networks are h...
Wenjun Xiao, Behrooz Parhami
IPL
2006
71views more  IPL 2006»
13 years 5 months ago
Analysis of improved signcryption scheme with key privacy
In this paper, we analyse the Yang
Chik How Tan
IPL
2006
92views more  IPL 2006»
13 years 5 months ago
A constructive approach to sequential Nash equilibria
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
René Vestergaard
IPL
2006
95views more  IPL 2006»
13 years 5 months ago
Smaller superconcentrators of density 28
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...
Uwe Schöning
IPL
2006
89views more  IPL 2006»
13 years 5 months ago
Adaptive general perfectly periodic scheduling
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known...
Shailesh Patil, Vijay K. Garg
IPL
2006
84views more  IPL 2006»
13 years 5 months ago
Test suite oscillations
This paper proposes a set of new software test-diversity measures based on control oscillations of test suites. Oscillation Diversity uses conversion, inversion, and phase transfo...
Borislav Nikolik
IPL
2006
76views more  IPL 2006»
13 years 5 months ago
Fraction interpolation walking a Farey tree
We present an algorithm to find a proper fraction in simplest reduced terms between two reduced proper fractions. A proper fraction is a rational number m/n with
Marc Mosko, J. J. Garcia-Luna-Aceves
IPL
2006
86views more  IPL 2006»
13 years 5 months ago
Mu-calculus path checking
We investigate the path model checking problem for the
Nicolas Markey, Ph. Schnoebelen
IPL
2006
70views more  IPL 2006»
13 years 5 months ago
A polynomial time approximation scheme for embedding a directed hypergraph on a ring
We study the problem of embedding a directed hypergraph on a ring that has applications in optical network communications. The undirected version (MCHEC) has been extensively stud...
Kang Li, Lusheng Wang