Sciweavers

2398 search results - page 318 / 480
» Constraint Programming and Graph Algorithms
Sort
View
178
Voted
ICDCS
2002
IEEE
15 years 10 months ago
Scheduling Real-Time Data Items In Multiple Channels And Multiple Receivers Environments
In the real-time environments, information is disseminated to clients with timing constraint. In this paper, we focus on the real time data scheduling problem in multiple broadcas...
Guanling Lee, Yi-Ning Pan, Arbee L. P. Chen
DGCI
2009
Springer
15 years 8 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
127
Voted
SAT
2004
Springer
95views Hardware» more  SAT 2004»
15 years 10 months ago
Local Search for Very Large SAT Problems
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
Steven David Prestwich, Colin Quirke
INFOCOM
2007
IEEE
15 years 11 months ago
Towards Topology Aware Networks
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
Christos Gkantsidis, Gagan Goel, Milena Mihail, Am...
ADHOCNOW
2004
Springer
15 years 10 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi