Sciweavers

942 search results - page 135 / 189
» Distance Constraint Satisfaction Problems
Sort
View
121
Voted
CPC
2006
110views more  CPC 2006»
15 years 3 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
CP
2008
Springer
15 years 5 months ago
Model Restarts for Structural Symmetry Breaking
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
Daniel S. Heller, Aurojit Panda, Meinolf Sellmann,...
SBACPAD
2007
IEEE
85views Hardware» more  SBACPAD 2007»
15 years 9 months ago
Exigency-based real-time scheduling policy to provide absolute QoS for web services
— Telemedicine, distance learning and e-commerce applications impose time constraints directly related to the efficacy of their operations. In order to offer reliability levels ...
Lucas S. Casagrande, Rodrigo Fernandes de Mello, R...
ADHOCNOW
2008
Springer
15 years 9 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
285
Voted
EOR
2007
364views more  EOR 2007»
15 years 3 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia