Sciweavers

2398 search results - page 367 / 480
» Constraint Programming and Graph Algorithms
Sort
View
ASPLOS
1992
ACM
15 years 9 months ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam
GRID
2006
Springer
15 years 4 months ago
Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid
One of the first motivations of using grids comes from applications managing large data sets in field such as high energy physics or life sciences. To improve the global throughput...
Frederic Desprez, Antoine Vernois
CP
2005
Springer
15 years 10 months ago
Probabilistic Arc Consistency
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
Deepak Mehta, Marc R. C. van Dongen
AAAI
2007
15 years 7 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
TSP
2012
14 years 12 days ago
Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...