Sciweavers

669 search results - page 47 / 134
» New Constraint Programming Approaches for the Computation of...
Sort
View
PPSN
2010
Springer
13 years 7 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
NOSSDAV
2001
Springer
14 years 28 days ago
Dimensioning server access bandwidth and multicast routing in overlay networks
Application-level multicast is a new mechanism for enabling multicast in the Internet. Driven by the fast growth of network audio/video streams, application-level multicast has be...
Sherlia Shi, Jonathan S. Turner, Marcel Waldvogel
SIGGRAPH
1992
ACM
14 years 17 days ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
WCNC
2010
IEEE
13 years 6 months ago
On MIMO Cognitive Radios with Antenna Selection
—With the ever increasing interest in multiple-input multiple-output (MIMO) cognitive radio (CR) systems, reducing the costs associated with RF-chains at the radio front end beco...
Muhammad Fainan Hanif, Peter J. Smith
PODS
2006
ACM
137views Database» more  PODS 2006»
14 years 8 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash