Sciweavers

703 search results - page 32 / 141
» Maintenance scheduling problems as benchmarks for constraint...
Sort
View
CSCLP
2006
Springer
15 years 1 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
EDBT
2000
ACM
15 years 1 months ago
Temporal View Self-Maintenance
Warehouse view self-maintenance refers to maintaining materialized views at a data warehouse without accessing source data. Self-maintenance has been studied for nontemporal views...
Jun Yang 0001, Jennifer Widom
ATAL
2003
Springer
15 years 2 months ago
Scheduling tasks with precedence constraints to solicit desirable bid combinations
In our previous research we suggested an approach to maximizing agents preferences over schedules of multiple tasks with temporal and precedence constraints. The proposed approach...
Alexander Babanov, John Collins, Maria L. Gini
SPAA
2009
ACM
15 years 10 months ago
Approximation algorithms for time-constrained scheduling on line networks
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...
Harald Räcke, Adi Rosén
TWC
2010
14 years 4 months ago
Fast algorithms for joint power control and scheduling in wireless networks
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus-noise rat...
Liqun Fu, Soung Chang Liew, Jianwei Huang