Sciweavers

16404 search results - page 70 / 3281
» A set coverage problem
Sort
View
VLDB
2007
ACM
128views Database» more  VLDB 2007»
15 years 6 months ago
A genetic approach for random testing of database systems
Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreo...
Hardik Bati, Leo Giakoumakis, Steve Herbert, Aleks...
INFOCOM
2010
IEEE
14 years 11 months ago
Deploying Mesh Nodes under Non-Uniform Propagation
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...
Joshua Robinson, Mohit Singh, Ram Swaminathan, Edw...
104
Voted
DATE
2005
IEEE
176views Hardware» more  DATE 2005»
15 years 2 months ago
LORD: A Localized, Reactive and Distributed Protocol for Node Scheduling in Wireless Sensor Networks
The lifetime of wireless sensor networks can be increased by minimizing the number of active nodes that provide complete coverage, while switching off the rest. In this paper, we ...
Arijit Ghosh, Tony Givargis
HEURISTICS
2002
152views more  HEURISTICS 2002»
15 years 11 days 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
ML
2008
ACM
156views Machine Learning» more  ML 2008»
15 years 17 days ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani