Sciweavers

867 search results - page 86 / 174
» The Generalized Maximum Coverage Problem
Sort
View
ICDCS
2006
IEEE
14 years 2 months ago
Self-Protection for Wireless Sensor Networks
Wireless sensor networks have recently been suggested for many surveillance applications such as object monitoring, path protection, or area coverage. Since the sensors themselves...
Dan Wang, Qian Zhang, Jiangchuan Liu
ISSTA
2006
ACM
14 years 1 months ago
Path-oriented random testing
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
Arnaud Gotlieb, Matthieu Petit
HEURISTICS
2002
152views more  HEURISTICS 2002»
13 years 7 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
ICST
2009
IEEE
14 years 2 months ago
Optimizing Probabilities of Real-Time Test Case Execution
—Model-based test derivation for real-time system has been proven to be a hard problem for exhaustive test suites. Therefore, techniques for real-time testing do not aim to exhau...
Nicolás Wolovick, Pedro R. D'Argenio, Hongy...
CCR
2006
122views more  CCR 2006»
13 years 8 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer