Sciweavers

1220 search results - page 35 / 244
» Minimal Interval Completions
Sort
View
CSE
2009
IEEE
14 years 1 months ago
Completely Distributed Low Duty Cycle Communication for Long-Living Sensor Networks
A lifetime of several years for wireless sensor nodes can be achieved if their activity period is minimized. This can be done by using low duty cycle protocols. One of the challeng...
Marcin Brzozowski, Hendrik Salomon, Peter Langendo...
MEMBRANE
2004
Springer
14 years 3 months ago
Communicative P Systems with Minimal Cooperation
We proved that two classes of Communicative P systems with 3 membranes and with minimal cooperation, namely P systems with symport/antiport rules of size 1 and and P systems with s...
Artiom Alhazov, Maurice Margenstern, Vladimir Rogo...
SWAT
2004
Springer
125views Algorithms» more  SWAT 2004»
14 years 3 months ago
The Optimal Online Algorithms for Minimizing Maximum Lateness
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
Patchrawat Uthaisombut
APSEC
2001
IEEE
14 years 1 months ago
Scheduling Software Projects to Minimize the Development Time and Cost with a Given Staff
A probabilistic scheduling model for software projects is presented. The model explicitly takes a scheduling strategy as input. When the scheduling strategy is fixed, the model ou...
Frank Padberg
CSJM
2006
79views more  CSJM 2006»
13 years 9 months ago
Generating Languages by P Systems with Minimal Symport/Antiport
It is known that P systems with two membranes and minimal symport/antiport rules are "almost" computationally complete as generators of number or vector sets. Interpreti...
Artiom Alhazov, Yurii Rogozhin