Sciweavers

2446 search results - page 228 / 490
» Choiceless Polynomial Time
Sort
View
WCNC
2008
IEEE
14 years 2 months ago
Connectivity-Aware Network Maintenance via Relays Deployment
— In this paper, we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is...
Ahmed S. Ibrahim, Karim G. Seddik, K. J. Ray Liu
ACSD
2007
IEEE
102views Hardware» more  ACSD 2007»
14 years 2 months ago
Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in...
Franck Cassez, Stavros Tripakis, Karine Altisen
ICPADS
2007
IEEE
14 years 2 months ago
Energy-efficient anonymous multicast in mobile ad-hoc networks
Protecting personal privacy and energy efficiency are two primary concerns for mobile ad hoc networks. However, no energy-efficient multicast algorithm designed for preserving ano...
Jung-Chun Kao, Radu Marculescu
IPPS
2007
IEEE
14 years 2 months ago
Period-Dependent Initial Values for Exact Schedulability Test of Rate Monotonic Systems
Real-time systems using Rate Monotonic fixed priority scheduling can be checked for schedulability either by pessimistic schedulability conditions or exact testing. Exact testing ...
Wan-Chen Lu, Kwei-Jay Lin, Hsin-Wen Wei, Wei Kuan ...
CSR
2007
Springer
14 years 2 months ago
New Bounds for MAX-SAT by Clause Learning
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
Alexander S. Kulikov, Konstantin Kutzkov