Sciweavers

4488 search results - page 243 / 898
» Properties of NP-Complete Sets
Sort
View
195
Voted
EOR
2007
111views more  EOR 2007»
15 years 6 months ago
Linear programming based algorithms for preemptive and non-preemptive RCPSP
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
Jean Damay, Alain Quilliot, Eric Sanlaville
NAR
2006
188views more  NAR 2006»
15 years 6 months ago
BiologicalNetworks: visualization and analysis tool for systems biology
Systemslevelinvestigationofgenomicscaleinformation requires the development of truly integrated databases dealing with heterogeneous data, which can be queried for simple properti...
Michael Baitaluk, Mayya Sedova, Animesh Ray, Amarn...
IJIS
2007
93views more  IJIS 2007»
15 years 6 months ago
Perspectives on ontology-based querying
In this paper, we introduce principles for ontology-based querying of information bases. We consider a framework in which a basis ontology over atomic concepts in combination with ...
Rasmus Knappe, Henrik Bulskov, Troels Andreasen
SP
2008
IEEE
134views Security Privacy» more  SP 2008»
15 years 6 months ago
Expressive Declassification Policies and Modular Static Enforcement
This paper provides a way to specify expressive declassification policies, in particular, when, what, and where policies that include conditions under which downgrading is allowed...
Anindya Banerjee, David A. Naumann, Stan Rosenberg
ITA
2007
118views Communications» more  ITA 2007»
15 years 6 months ago
Uniformly bounded duplication codes
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing dupl...
Peter Leupold, Victor Mitrana