Sciweavers

3353 search results - page 300 / 671
» Laver and set theory
Sort
View
SIAMDM
2008
113views more  SIAMDM 2008»
15 years 6 months ago
Power Domination in Product Graphs
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dom...
Paul Dorbec, Michel Mollard, Sandi Klavzar, Simon ...
APAL
2005
154views more  APAL 2005»
15 years 6 months ago
A Sahlqvist theorem for distributive modal logic
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
Mai Gehrke, Hideo Nagahashi, Yde Venema
ECCC
2002
68views more  ECCC 2002»
15 years 6 months ago
Bi-Immunity Separates Strong NP-Completeness Notions
We prove that if for some > 0, NP contains a set that is DTIME(2n )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-t...
Aduri Pavan, Alan L. Selman
MOR
2000
90views more  MOR 2000»
15 years 6 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
ISJ
2002
71views more  ISJ 2002»
15 years 6 months ago
Educating reflective systems developers
Systems development research shows that practitioners seldom follow methods and that the competencies required for successful development of computer-based systems go well beyond t...
Lars Mathiassen, Sandeep Purao