1299 search results - page 7 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
CONSTRAINTS
2007
14 years 9 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
ICDCSW
2003
IEEE
15 years 2 months ago
2003
IEEE
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
TPDS
2010
14 years 8 months ago
2010
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
ICTAC
2004
Springer
15 years 3 months ago
2004
Springer
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...