2446 search results - page 228 / 490 » Choiceless Polynomial Time |
118
Voted
WCNC
2008
IEEE
15 years 10 months ago
2008
IEEE
— 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...
142
click to vote
ACSD
2007
IEEE
15 years 10 months ago
2007
IEEE
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...
147
Voted
ICPADS
2007
IEEE
15 years 10 months ago
2007
IEEE
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...
131
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Real-time systems using Rate Monotonic fixed priority scheduling can be checked for schedulability either by pessimistic schedulability conditions or exact testing. Exact testing ...
121
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
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...