Sciweavers

16404 search results - page 132 / 3281
» A set coverage problem
Sort
View
ICTAC
2009
Springer
15 years 1 months ago
Integration Testing from Structured First-Order Specifications via Deduction Modulo
Testing from first-order specifications has mainly been studied for flat specifications, that are specifications of a single software module. However, the specifications of large s...
Delphine Longuet, Marc Aiguier
ECAI
2006
Springer
15 years 7 months ago
Compact Representation of Sets of Binary Constraints
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...
Jussi Rintanen
MST
2006
99views more  MST 2006»
15 years 3 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
15 years 3 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin
SUTC
2006
IEEE
15 years 9 months ago
Power-aware Node Deployment in Wireless Sensor Networks
Sensor networks have attracted intensive interests due to its extendable capability. In this paper, we attempt to answer a fundamental but practical question:” how should we dep...
Yunhuai Liu, Hoilun Ngan, Lionel M. Ni